TSTP Solution File: SWW438-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWW438-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 00:12:57 EDT 2022
% Result : Unsatisfiable 6.15s 1.18s
% Output : CNFRefutation 6.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWW438-1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 6 04:27:32 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.20/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Number of axioms: 27 Number of unprocessed: 27
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.38 # The folding up rule is enabled...
% 0.20/0.38 # Local unification is enabled...
% 0.20/0.38 # Any saturation attempts will use folding labels...
% 0.20/0.38 # 27 beginning clauses after preprocessing and clausification
% 0.20/0.38 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.20/0.38 # Creating start rules for all 1 conjectures.
% 0.20/0.38 # There are 1 start rule candidates:
% 0.20/0.38 # Found 20 unit axioms.
% 0.20/0.38 # 1 start rule tableaux created.
% 0.20/0.38 # 8 extension rule candidate clauses
% 0.20/0.38 # 20 unit axiom clauses
% 0.20/0.38
% 0.20/0.38 # Requested 8, 32 cores available to the main process.
% 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.38 # Creating equality axioms
% 0.20/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.38 # Returning from population with 33 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.38 # We now have 33 tableaux to operate on
% 6.15/1.18 # There were 1 total branch saturation attempts.
% 6.15/1.18 # There were 0 of these attempts blocked.
% 6.15/1.18 # There were 0 deferred branch saturation attempts.
% 6.15/1.18 # There were 0 free duplicated saturations.
% 6.15/1.18 # There were 1 total successful branch saturations.
% 6.15/1.18 # There were 0 successful branch saturations in interreduction.
% 6.15/1.18 # There were 0 successful branch saturations on the branch.
% 6.15/1.18 # There were 1 successful branch saturations after the branch.
% 6.15/1.18 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.15/1.18 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.15/1.18 # Begin clausification derivation
% 6.15/1.18
% 6.15/1.18 # End clausification derivation
% 6.15/1.18 # Begin listing active clauses obtained from FOF to CNF conversion
% 6.15/1.18 cnf(i_0_40, hypothesis, (x11!=x6)).
% 6.15/1.18 cnf(i_0_41, hypothesis, (x7!=x6)).
% 6.15/1.18 cnf(i_0_50, hypothesis, (x11!=x10)).
% 6.15/1.18 cnf(i_0_42, hypothesis, (x3!=x10)).
% 6.15/1.18 cnf(i_0_43, hypothesis, (x3!=x14)).
% 6.15/1.18 cnf(i_0_44, hypothesis, (x15!=x7)).
% 6.15/1.18 cnf(i_0_46, hypothesis, (x9!=x14)).
% 6.15/1.18 cnf(i_0_45, hypothesis, (x9!=x15)).
% 6.15/1.18 cnf(i_0_49, hypothesis, (x16!=x14)).
% 6.15/1.18 cnf(i_0_47, hypothesis, (x16!=x2)).
% 6.15/1.18 cnf(i_0_54, hypothesis, (x5!=x15)).
% 6.15/1.18 cnf(i_0_52, hypothesis, (x9!=x5)).
% 6.15/1.18 cnf(i_0_48, hypothesis, (x5!=x2)).
% 6.15/1.18 cnf(i_0_53, hypothesis, (x5!=x16)).
% 6.15/1.18 cnf(i_0_51, hypothesis, (x15!=x13)).
% 6.15/1.18 cnf(i_0_30, plain, (sep(lseg(X1,X1),X2)=X2)).
% 6.15/1.18 cnf(i_0_29, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))).
% 6.15/1.18 cnf(i_0_31, plain, (~heap(sep(next(nil,X1),X2)))).
% 6.15/1.18 cnf(i_0_32, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))).
% 6.15/1.18 cnf(i_0_33, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))).
% 6.15/1.18 cnf(i_0_34, plain, (X1=X3|~heap(sep(next(X1,X2),sep(lseg(X1,X3),X4))))).
% 6.15/1.18 cnf(i_0_35, plain, (X1=X3|X1=X2|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))).
% 6.15/1.18 cnf(i_0_37, plain, (heap(sep(lseg(X1,nil),X3))|~heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))))).
% 6.15/1.18 cnf(i_0_36, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))).
% 6.15/1.18 cnf(i_0_38, plain, (heap(sep(lseg(X1,X3),sep(next(X3,X4),X5)))|~heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5)))))).
% 6.15/1.18 cnf(i_0_39, plain, (X3=X4|heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))|~heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5)))))).
% 6.15/1.18 cnf(i_0_55, hypothesis, (heap(sep(lseg(x14,x12),sep(lseg(x2,x13),sep(lseg(x13,x6),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x7,x2),sep(lseg(x7,x16),sep(lseg(x3,x14),sep(lseg(x11,x4),sep(lseg(x6,x14),sep(lseg(x6,x16),emp))))))))))))))).
% 6.15/1.18 cnf(i_0_97, plain, (X6=X6)).
% 6.15/1.18 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 6.15/1.18 # Begin printing tableau
% 6.15/1.18 # Found 6 steps
% 6.15/1.18 cnf(i_0_40, hypothesis, (x11!=x6), inference(start_rule)).
% 6.15/1.18 cnf(i_0_105, plain, (x11!=x6), inference(extension_rule, [i_0_35])).
% 6.15/1.18 cnf(i_0_147, plain, (x11=x6), inference(closure_rule, [i_0_40])).
% 6.15/1.18 cnf(i_0_149, plain, (~heap(sep(lseg(x11,x6),sep(lseg(x11,x6),X11)))), inference(extension_rule, [i_0_36])).
% 6.15/1.18 cnf(i_0_190, plain, (x11=x6), inference(closure_rule, [i_0_40])).
% 6.15/1.18 cnf(i_0_192, plain, (~heap(sep(next(x11,x6),sep(lseg(x6,x6),sep(lseg(x11,x6),X11))))), inference(etableau_closure_rule, [i_0_192, ...])).
% 6.15/1.18 # End printing tableau
% 6.15/1.18 # SZS output end
% 6.15/1.18 # Branches closed with saturation will be marked with an "s"
% 6.15/1.18 # Child (26879) has found a proof.
% 6.15/1.18
% 6.15/1.18 # Proof search is over...
% 6.15/1.18 # Freeing feature tree
%------------------------------------------------------------------------------