TSTP Solution File: SWW421-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWW421-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 : n028.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:55 EDT 2022
% Result : Unsatisfiable 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW421-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jun 5 21:44:28 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.15/0.38 # No SInE strategy applied
% 0.15/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.15/0.38 #
% 0.15/0.38 # Presaturation interreduction done
% 0.15/0.38 # Number of axioms: 16 Number of unprocessed: 16
% 0.15/0.38 # Tableaux proof search.
% 0.15/0.38 # APR header successfully linked.
% 0.15/0.38 # Hello from C++
% 0.15/0.38 # The folding up rule is enabled...
% 0.15/0.38 # Local unification is enabled...
% 0.15/0.38 # Any saturation attempts will use folding labels...
% 0.15/0.38 # 16 beginning clauses after preprocessing and clausification
% 0.15/0.38 # Creating start rules for all 1 conjectures.
% 0.15/0.38 # There are 1 start rule candidates:
% 0.15/0.38 # Found 9 unit axioms.
% 0.15/0.38 # 1 start rule tableaux created.
% 0.15/0.38 # 7 extension rule candidate clauses
% 0.15/0.38 # 9 unit axiom clauses
% 0.15/0.38
% 0.15/0.38 # Requested 8, 32 cores available to the main process.
% 0.15/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.15/0.38 # Creating equality axioms
% 0.15/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.15/0.38 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.38 # We now have 24 tableaux to operate on
% 0.15/0.40 # There were 1 total branch saturation attempts.
% 0.15/0.40 # There were 0 of these attempts blocked.
% 0.15/0.40 # There were 0 deferred branch saturation attempts.
% 0.15/0.40 # There were 0 free duplicated saturations.
% 0.15/0.40 # There were 1 total successful branch saturations.
% 0.15/0.40 # There were 0 successful branch saturations in interreduction.
% 0.15/0.40 # There were 0 successful branch saturations on the branch.
% 0.15/0.40 # There were 1 successful branch saturations after the branch.
% 0.15/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # Begin clausification derivation
% 0.15/0.40
% 0.15/0.40 # End clausification derivation
% 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40 cnf(i_0_18, plain, (sep(lseg(X1,X1),X2)=X2)).
% 0.15/0.40 cnf(i_0_31, hypothesis, (heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))))).
% 0.15/0.40 cnf(i_0_17, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))).
% 0.15/0.40 cnf(i_0_30, hypothesis, (x3!=x1)).
% 0.15/0.40 cnf(i_0_32, negated_conjecture, (~heap(sep(lseg(x1,x3),emp)))).
% 0.15/0.40 cnf(i_0_28, hypothesis, (x1!=nil)).
% 0.15/0.40 cnf(i_0_29, hypothesis, (x2!=x1)).
% 0.15/0.40 cnf(i_0_19, plain, (~heap(sep(next(nil,X1),X2)))).
% 0.15/0.40 cnf(i_0_21, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))).
% 0.15/0.40 cnf(i_0_20, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))).
% 0.15/0.40 cnf(i_0_22, plain, (X1=X2|~heap(sep(next(X1,X3),sep(lseg(X1,X2),X4))))).
% 0.15/0.40 cnf(i_0_23, plain, (X1=X2|X1=X3|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))).
% 0.15/0.40 cnf(i_0_25, plain, (heap(sep(lseg(X1,nil),X2))|~heap(sep(lseg(X1,X3),sep(lseg(X3,nil),X2))))).
% 0.15/0.40 cnf(i_0_24, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))).
% 0.15/0.40 cnf(i_0_26, plain, (heap(sep(lseg(X1,X2),sep(next(X2,X3),X4)))|~heap(sep(lseg(X1,X5),sep(lseg(X5,X2),sep(next(X2,X3),X4)))))).
% 0.15/0.40 cnf(i_0_27, plain, (X1=X2|heap(sep(lseg(X3,X1),sep(lseg(X1,X2),X4)))|~heap(sep(lseg(X3,X5),sep(lseg(X5,X1),sep(lseg(X1,X2),X4)))))).
% 0.15/0.40 cnf(i_0_68, plain, (X6=X6)).
% 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.40 # Begin printing tableau
% 0.15/0.40 # Found 6 steps
% 0.15/0.40 cnf(i_0_18, plain, (sep(lseg(X13,X13),X6)=X6), inference(start_rule)).
% 0.15/0.40 cnf(i_0_76, plain, (sep(lseg(X13,X13),X6)=X6), inference(extension_rule, [i_0_73])).
% 0.15/0.40 cnf(i_0_131, plain, (sep(lseg(X1,X1),X4)!=X4), inference(closure_rule, [i_0_18])).
% 0.15/0.40 cnf(i_0_130, plain, (lseg(sep(lseg(X1,X1),X4),sep(lseg(X13,X13),X6))=lseg(X4,X6)), inference(extension_rule, [i_0_71])).
% 0.15/0.40 cnf(i_0_162, plain, (lseg(X4,X6)!=sep(lseg(X1,X1),lseg(X4,X6))), inference(closure_rule, [i_0_18])).
% 0.15/0.40 cnf(i_0_160, plain, (lseg(sep(lseg(X1,X1),X4),sep(lseg(X13,X13),X6))=sep(lseg(X1,X1),lseg(X4,X6))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.15/0.40 # End printing tableau
% 0.15/0.40 # SZS output end
% 0.15/0.40 # Branches closed with saturation will be marked with an "s"
% 0.15/0.40 # There were 1 total branch saturation attempts.
% 0.15/0.40 # There were 0 of these attempts blocked.
% 0.15/0.40 # There were 0 deferred branch saturation attempts.
% 0.15/0.40 # There were 0 free duplicated saturations.
% 0.15/0.40 # There were 1 total successful branch saturations.
% 0.15/0.40 # There were 0 successful branch saturations in interreduction.
% 0.15/0.40 # There were 0 successful branch saturations on the branch.
% 0.15/0.40 # There were 1 successful branch saturations after the branch.
% 0.15/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # Begin clausification derivation
% 0.15/0.40
% 0.15/0.40 # End clausification derivation
% 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40 cnf(i_0_18, plain, (sep(lseg(X1,X1),X2)=X2)).
% 0.15/0.40 cnf(i_0_31, hypothesis, (heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))))).
% 0.15/0.40 cnf(i_0_17, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))).
% 0.15/0.40 cnf(i_0_30, hypothesis, (x3!=x1)).
% 0.15/0.40 cnf(i_0_32, negated_conjecture, (~heap(sep(lseg(x1,x3),emp)))).
% 0.15/0.40 cnf(i_0_28, hypothesis, (x1!=nil)).
% 0.15/0.40 cnf(i_0_29, hypothesis, (x2!=x1)).
% 0.15/0.40 cnf(i_0_19, plain, (~heap(sep(next(nil,X1),X2)))).
% 0.15/0.40 cnf(i_0_21, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))).
% 0.15/0.40 cnf(i_0_20, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))).
% 0.15/0.40 cnf(i_0_22, plain, (X1=X2|~heap(sep(next(X1,X3),sep(lseg(X1,X2),X4))))).
% 0.15/0.40 cnf(i_0_23, plain, (X1=X2|X1=X3|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))).
% 0.15/0.40 cnf(i_0_25, plain, (heap(sep(lseg(X1,nil),X2))|~heap(sep(lseg(X1,X3),sep(lseg(X3,nil),X2))))).
% 0.15/0.40 cnf(i_0_24, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))).
% 0.15/0.40 cnf(i_0_26, plain, (heap(sep(lseg(X1,X2),sep(next(X2,X3),X4)))|~heap(sep(lseg(X1,X5),sep(lseg(X5,X2),sep(next(X2,X3),X4)))))).
% 0.15/0.40 cnf(i_0_27, plain, (X1=X2|heap(sep(lseg(X3,X1),sep(lseg(X1,X2),X4)))|~heap(sep(lseg(X3,X5),sep(lseg(X5,X1),sep(lseg(X1,X2),X4)))))).
% 0.15/0.40 cnf(i_0_68, plain, (X6=X6)).
% 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.40 # Begin printing tableau
% 0.15/0.40 # Found 6 steps
% 0.15/0.40 cnf(i_0_18, plain, (sep(lseg(X7,X7),X4)=X4), inference(start_rule)).
% 0.15/0.40 cnf(i_0_76, plain, (sep(lseg(X7,X7),X4)=X4), inference(extension_rule, [i_0_73])).
% 0.15/0.40 cnf(i_0_132, plain, (sep(lseg(X1,X1),X6)!=X6), inference(closure_rule, [i_0_18])).
% 0.15/0.40 cnf(i_0_130, plain, (lseg(sep(lseg(X7,X7),X4),sep(lseg(X1,X1),X6))=lseg(X4,X6)), inference(extension_rule, [i_0_71])).
% 0.15/0.40 cnf(i_0_162, plain, (lseg(X4,X6)!=sep(lseg(X1,X1),lseg(X4,X6))), inference(closure_rule, [i_0_18])).
% 0.15/0.40 cnf(i_0_160, plain, (lseg(sep(lseg(X7,X7),X4),sep(lseg(X1,X1),X6))=sep(lseg(X1,X1),lseg(X4,X6))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.15/0.40 # End printing tableau
% 0.15/0.40 # SZS output end
% 0.15/0.40 # Branches closed with saturation will be marked with an "s"
% 0.15/0.40 # There were 1 total branch saturation attempts.
% 0.15/0.40 # There were 0 of these attempts blocked.
% 0.15/0.40 # There were 0 deferred branch saturation attempts.
% 0.15/0.40 # There were 0 free duplicated saturations.
% 0.15/0.40 # There were 1 total successful branch saturations.
% 0.15/0.40 # There were 0 successful branch saturations in interreduction.
% 0.15/0.40 # There were 0 successful branch saturations on the branch.
% 0.15/0.40 # There were 1 successful branch saturations after the branch.
% 0.15/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # Begin clausification derivation
% 0.15/0.40
% 0.15/0.40 # End clausification derivation
% 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40 cnf(i_0_18, plain, (sep(lseg(X1,X1),X2)=X2)).
% 0.15/0.40 cnf(i_0_31, hypothesis, (heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))))).
% 0.15/0.40 cnf(i_0_17, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))).
% 0.15/0.40 cnf(i_0_30, hypothesis, (x3!=x1)).
% 0.15/0.40 cnf(i_0_32, negated_conjecture, (~heap(sep(lseg(x1,x3),emp)))).
% 0.15/0.40 cnf(i_0_28, hypothesis, (x1!=nil)).
% 0.15/0.40 cnf(i_0_29, hypothesis, (x2!=x1)).
% 0.15/0.40 cnf(i_0_19, plain, (~heap(sep(next(nil,X1),X2)))).
% 0.15/0.40 cnf(i_0_21, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))).
% 0.15/0.40 cnf(i_0_20, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))).
% 0.15/0.40 cnf(i_0_22, plain, (X1=X2|~heap(sep(next(X1,X3),sep(lseg(X1,X2),X4))))).
% 0.15/0.40 cnf(i_0_23, plain, (X1=X2|X1=X3|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))).
% 0.15/0.40 cnf(i_0_25, plain, (heap(sep(lseg(X1,nil),X2))|~heap(sep(lseg(X1,X3),sep(lseg(X3,nil),X2))))).
% 0.15/0.40 cnf(i_0_24, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))).
% 0.15/0.40 cnf(i_0_26, plain, (heap(sep(lseg(X1,X2),sep(next(X2,X3),X4)))|~heap(sep(lseg(X1,X5),sep(lseg(X5,X2),sep(next(X2,X3),X4)))))).
% 0.15/0.40 cnf(i_0_27, plain, (X1=X2|heap(sep(lseg(X3,X1),sep(lseg(X1,X2),X4)))|~heap(sep(lseg(X3,X5),sep(lseg(X5,X1),sep(lseg(X1,X2),X4)))))).
% 0.15/0.40 cnf(i_0_68, plain, (X6=X6)).
% 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.40 # Begin printing tableau
% 0.15/0.40 # Found 6 steps
% 0.15/0.40 cnf(i_0_18, plain, (sep(lseg(X13,X13),X5)=X5), inference(start_rule)).
% 0.15/0.40 cnf(i_0_76, plain, (sep(lseg(X13,X13),X5)=X5), inference(extension_rule, [i_0_72])).
% 0.15/0.40 cnf(i_0_128, plain, (sep(lseg(X1,X1),lseg(X1,X1))!=lseg(X1,X1)), inference(closure_rule, [i_0_18])).
% 0.15/0.40 cnf(i_0_127, plain, (sep(sep(lseg(X1,X1),lseg(X1,X1)),sep(lseg(X13,X13),X5))=sep(lseg(X1,X1),X5)), inference(extension_rule, [i_0_71])).
% 0.15/0.40 cnf(i_0_162, plain, (sep(lseg(X1,X1),X5)!=X5), inference(closure_rule, [i_0_18])).
% 0.15/0.40 cnf(i_0_160, plain, (sep(sep(lseg(X1,X1),lseg(X1,X1)),sep(lseg(X13,X13),X5))=X5), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.15/0.40 # End printing tableau
% 0.15/0.40 # SZS output end
% 0.15/0.40 # Branches closed with saturation will be marked with an "s"
% 0.15/0.40 # There were 1 total branch saturation attempts.
% 0.15/0.40 # There were 0 of these attempts blocked.
% 0.15/0.40 # There were 0 deferred branch saturation attempts.
% 0.15/0.40 # There were 0 free duplicated saturations.
% 0.15/0.40 # There were 1 total successful branch saturations.
% 0.15/0.40 # There were 0 successful branch saturations in interreduction.
% 0.15/0.40 # There were 0 successful branch saturations on the branch.
% 0.15/0.40 # There were 1 successful branch saturations after the branch.
% 0.15/0.40 # Child (11514) has found a proof.
% 0.15/0.40
% 0.15/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # Begin clausification derivation
% 0.15/0.40
% 0.15/0.40 # End clausification derivation
% 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.40 cnf(i_0_18, plain, (sep(lseg(X1,X1),X2)=X2)).
% 0.15/0.40 cnf(i_0_31, hypothesis, (heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))))).
% 0.15/0.40 cnf(i_0_17, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))).
% 0.15/0.40 cnf(i_0_30, hypothesis, (x3!=x1)).
% 0.15/0.40 cnf(i_0_32, negated_conjecture, (~heap(sep(lseg(x1,x3),emp)))).
% 0.15/0.40 cnf(i_0_28, hypothesis, (x1!=nil)).
% 0.15/0.40 cnf(i_0_29, hypothesis, (x2!=x1)).
% 0.15/0.40 cnf(i_0_19, plain, (~heap(sep(next(nil,X1),X2)))).
% 0.15/0.40 cnf(i_0_21, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))).
% 0.15/0.40 cnf(i_0_20, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))).
% 0.15/0.40 cnf(i_0_22, plain, (X1=X2|~heap(sep(next(X1,X3),sep(lseg(X1,X2),X4))))).
% 0.15/0.40 cnf(i_0_23, plain, (X1=X2|X1=X3|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))).
% 0.15/0.40 cnf(i_0_25, plain, (heap(sep(lseg(X1,nil),X2))|~heap(sep(lseg(X1,X3),sep(lseg(X3,nil),X2))))).
% 0.15/0.40 cnf(i_0_24, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))).
% 0.15/0.40 cnf(i_0_26, plain, (heap(sep(lseg(X1,X2),sep(next(X2,X3),X4)))|~heap(sep(lseg(X1,X5),sep(lseg(X5,X2),sep(next(X2,X3),X4)))))).
% 0.15/0.40 cnf(i_0_27, plain, (X1=X2|heap(sep(lseg(X3,X1),sep(lseg(X1,X2),X4)))|~heap(sep(lseg(X3,X5),sep(lseg(X5,X1),sep(lseg(X1,X2),X4)))))).
% 0.15/0.40 cnf(i_0_68, plain, (X6=X6)).
% 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.40 # Begin printing tableau
% 0.15/0.40 # Found 6 steps
% 0.15/0.40 cnf(i_0_18, plain, (sep(lseg(X9,X9),X6)=X6), inference(start_rule)).
% 0.15/0.40 cnf(i_0_76, plain, (sep(lseg(X9,X9),X6)=X6), inference(extension_rule, [i_0_74])).
% 0.15/0.40 cnf(i_0_134, plain, (sep(lseg(X1,X1),X4)!=X4), inference(closure_rule, [i_0_18])).
% 0.15/0.40 cnf(i_0_133, plain, (next(sep(lseg(X1,X1),X4),sep(lseg(X9,X9),X6))=next(X4,X6)), inference(extension_rule, [i_0_71])).
% 0.15/0.40 cnf(i_0_162, plain, (next(X4,X6)!=sep(lseg(X1,X1),next(X4,X6))), inference(closure_rule, [i_0_18])).
% 0.15/0.40 cnf(i_0_160, plain, (next(sep(lseg(X1,X1),X4),sep(lseg(X9,X9),X6))=sep(lseg(X1,X1),next(X4,X6))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.15/0.40 # End printing tableau
% 0.15/0.40 # SZS output end
% 0.15/0.40 # Branches closed with saturation will be marked with an "s"
% 0.15/0.40 # Proof search is over...
% 0.15/0.40 # Freeing feature tree
%------------------------------------------------------------------------------