TSTP Solution File: SWW429-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWW429-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 : n029.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:56 EDT 2022
% Result : Unsatisfiable 3.98s 0.87s
% Output : CNFRefutation 3.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW429-1 : TPTP v8.1.0. Released v5.2.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 4 21:37:48 EDT 2022
% 0.13/0.34 % 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: 17 Number of unprocessed: 17
% 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.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 17 beginning clauses after preprocessing and clausification
% 0.20/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.20/0.37 # Creating start rules for all 1 conjectures.
% 0.20/0.37 # There are 1 start rule candidates:
% 0.20/0.37 # Found 10 unit axioms.
% 0.20/0.37 # 1 start rule tableaux created.
% 0.20/0.37 # 8 extension rule candidate clauses
% 0.20/0.37 # 10 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.37 # Creating equality axioms
% 0.20/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.37 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 23 tableaux to operate on
% 3.98/0.87 # There were 1 total branch saturation attempts.
% 3.98/0.87 # There were 0 of these attempts blocked.
% 3.98/0.87 # There were 0 deferred branch saturation attempts.
% 3.98/0.87 # There were 0 free duplicated saturations.
% 3.98/0.87 # There were 1 total successful branch saturations.
% 3.98/0.87 # There were 0 successful branch saturations in interreduction.
% 3.98/0.87 # There were 0 successful branch saturations on the branch.
% 3.98/0.87 # There were 1 successful branch saturations after the branch.
% 3.98/0.87 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.98/0.87 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.98/0.87 # Begin clausification derivation
% 3.98/0.87
% 3.98/0.87 # End clausification derivation
% 3.98/0.87 # Begin listing active clauses obtained from FOF to CNF conversion
% 3.98/0.87 cnf(i_0_30, hypothesis, (x4!=x7)).
% 3.98/0.87 cnf(i_0_31, hypothesis, (x10!=x4)).
% 3.98/0.87 cnf(i_0_32, hypothesis, (x3!=x8)).
% 3.98/0.87 cnf(i_0_33, hypothesis, (x2!=x9)).
% 3.98/0.87 cnf(i_0_34, hypothesis, (x9!=x5)).
% 3.98/0.87 cnf(i_0_20, plain, (sep(lseg(X1,X1),X2)=X2)).
% 3.98/0.87 cnf(i_0_19, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))).
% 3.98/0.87 cnf(i_0_21, plain, (~heap(sep(next(nil,X1),X2)))).
% 3.98/0.87 cnf(i_0_22, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))).
% 3.98/0.87 cnf(i_0_23, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))).
% 3.98/0.87 cnf(i_0_24, plain, (X1=X3|~heap(sep(next(X1,X2),sep(lseg(X1,X3),X4))))).
% 3.98/0.87 cnf(i_0_25, plain, (X1=X3|X1=X2|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))).
% 3.98/0.87 cnf(i_0_27, plain, (heap(sep(lseg(X1,nil),X3))|~heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))))).
% 3.98/0.87 cnf(i_0_26, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))).
% 3.98/0.87 cnf(i_0_28, 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)))))).
% 3.98/0.87 cnf(i_0_29, 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)))))).
% 3.98/0.87 cnf(i_0_35, hypothesis, (heap(sep(lseg(x5,x1),sep(lseg(x7,x12),sep(lseg(x7,x8),sep(lseg(x3,x5),sep(lseg(x3,x12),sep(lseg(x4,x12),sep(lseg(x4,x7),sep(lseg(x1,x6),sep(lseg(x6,x9),sep(lseg(x6,x7),sep(lseg(x8,x11),emp)))))))))))))).
% 3.98/0.87 cnf(i_0_77, plain, (X6=X6)).
% 3.98/0.87 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 3.98/0.87 # Begin printing tableau
% 3.98/0.87 # Found 6 steps
% 3.98/0.87 cnf(i_0_30, hypothesis, (x4!=x7), inference(start_rule)).
% 3.98/0.87 cnf(i_0_85, plain, (x4!=x7), inference(extension_rule, [i_0_25])).
% 3.98/0.87 cnf(i_0_117, plain, (x4=x7), inference(closure_rule, [i_0_30])).
% 3.98/0.87 cnf(i_0_119, plain, (~heap(sep(lseg(x4,x7),sep(lseg(x4,x7),X11)))), inference(extension_rule, [i_0_26])).
% 3.98/0.87 cnf(i_0_160, plain, (x4=x7), inference(closure_rule, [i_0_30])).
% 3.98/0.87 cnf(i_0_162, plain, (~heap(sep(next(x4,x7),sep(lseg(x7,x7),sep(lseg(x4,x7),X11))))), inference(etableau_closure_rule, [i_0_162, ...])).
% 3.98/0.87 # End printing tableau
% 3.98/0.87 # SZS output end
% 3.98/0.87 # Branches closed with saturation will be marked with an "s"
% 3.98/0.88 # There were 1 total branch saturation attempts.
% 3.98/0.88 # There were 0 of these attempts blocked.
% 3.98/0.88 # There were 0 deferred branch saturation attempts.
% 3.98/0.88 # There were 0 free duplicated saturations.
% 3.98/0.88 # There were 1 total successful branch saturations.
% 3.98/0.88 # There were 0 successful branch saturations in interreduction.
% 3.98/0.88 # There were 0 successful branch saturations on the branch.
% 3.98/0.88 # There were 1 successful branch saturations after the branch.
% 3.98/0.88 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.98/0.88 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.98/0.88 # Begin clausification derivation
% 3.98/0.88
% 3.98/0.88 # End clausification derivation
% 3.98/0.88 # Begin listing active clauses obtained from FOF to CNF conversion
% 3.98/0.88 cnf(i_0_30, hypothesis, (x4!=x7)).
% 3.98/0.88 cnf(i_0_31, hypothesis, (x10!=x4)).
% 3.98/0.88 cnf(i_0_32, hypothesis, (x3!=x8)).
% 3.98/0.88 cnf(i_0_33, hypothesis, (x2!=x9)).
% 3.98/0.88 cnf(i_0_34, hypothesis, (x9!=x5)).
% 3.98/0.88 cnf(i_0_20, plain, (sep(lseg(X1,X1),X2)=X2)).
% 3.98/0.88 cnf(i_0_19, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))).
% 3.98/0.88 cnf(i_0_21, plain, (~heap(sep(next(nil,X1),X2)))).
% 3.98/0.88 cnf(i_0_22, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))).
% 3.98/0.88 cnf(i_0_23, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))).
% 3.98/0.88 cnf(i_0_24, plain, (X1=X3|~heap(sep(next(X1,X2),sep(lseg(X1,X3),X4))))).
% 3.98/0.88 cnf(i_0_25, plain, (X1=X3|X1=X2|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))).
% 3.98/0.88 cnf(i_0_27, plain, (heap(sep(lseg(X1,nil),X3))|~heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))))).
% 3.98/0.88 cnf(i_0_26, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))).
% 3.98/0.88 cnf(i_0_28, 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)))))).
% 3.98/0.88 cnf(i_0_29, 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)))))).
% 3.98/0.88 cnf(i_0_35, hypothesis, (heap(sep(lseg(x5,x1),sep(lseg(x7,x12),sep(lseg(x7,x8),sep(lseg(x3,x5),sep(lseg(x3,x12),sep(lseg(x4,x12),sep(lseg(x4,x7),sep(lseg(x1,x6),sep(lseg(x6,x9),sep(lseg(x6,x7),sep(lseg(x8,x11),emp)))))))))))))).
% 3.98/0.88 cnf(i_0_77, plain, (X6=X6)).
% 3.98/0.88 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 3.98/0.88 # Begin printing tableau
% 3.98/0.88 # Found 6 steps
% 3.98/0.88 cnf(i_0_30, hypothesis, (x4!=x7), inference(start_rule)).
% 3.98/0.88 cnf(i_0_85, plain, (x4!=x7), inference(extension_rule, [i_0_25])).
% 3.98/0.88 cnf(i_0_118, plain, (x4=x7), inference(closure_rule, [i_0_30])).
% 3.98/0.88 cnf(i_0_119, plain, (~heap(sep(lseg(x4,x7),sep(lseg(x4,x7),X11)))), inference(extension_rule, [i_0_26])).
% 3.98/0.88 cnf(i_0_160, plain, (x4=x7), inference(closure_rule, [i_0_30])).
% 3.98/0.88 cnf(i_0_162, plain, (~heap(sep(next(x4,x7),sep(lseg(x7,x7),sep(lseg(x4,x7),X11))))), inference(etableau_closure_rule, [i_0_162, ...])).
% 3.98/0.88 # End printing tableau
% 3.98/0.88 # SZS output end
% 3.98/0.88 # Branches closed with saturation will be marked with an "s"
% 4.19/0.88 # Child (16835) has found a proof.
% 4.19/0.88
% 4.19/0.88 # Proof search is over...
% 4.19/0.88 # Freeing feature tree
%------------------------------------------------------------------------------