%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWW434-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 : n022.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.21s % Output : CNFRefutation 6.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SWW434-1 : TPTP v8.1.0. Released v5.2.0. % 0.08/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.36 % Computer : n022.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Sun Jun 5 08:03:21 EDT 2022 % 0.15/0.36 % CPUTime : % 0.22/0.39 # No SInE strategy applied % 0.22/0.39 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.22/0.39 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.22/0.39 # % 0.22/0.39 # Number of axioms: 19 Number of unprocessed: 19 % 0.22/0.39 # Tableaux proof search. % 0.22/0.39 # APR header successfully linked. % 0.22/0.39 # Hello from C++ % 0.22/0.39 # The folding up rule is enabled... % 0.22/0.39 # Local unification is enabled... % 0.22/0.39 # Any saturation attempts will use folding labels... % 0.22/0.39 # 19 beginning clauses after preprocessing and clausification % 0.22/0.39 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.22/0.39 # Creating start rules for all 1 conjectures. % 0.22/0.39 # There are 1 start rule candidates: % 0.22/0.39 # Found 12 unit axioms. % 0.22/0.39 # 1 start rule tableaux created. % 0.22/0.39 # 8 extension rule candidate clauses % 0.22/0.39 # 12 unit axiom clauses % 0.22/0.39 % 0.22/0.39 # Requested 8, 32 cores available to the main process. % 0.22/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.22/0.39 # Creating equality axioms % 0.22/0.39 # Ran out of tableaux, making start rules for all clauses % 0.22/0.39 # Returning from population with 25 new_tableaux and 0 remaining starting tableaux. % 0.22/0.39 # We now have 25 tableaux to operate on % 6.15/1.21 # There were 1 total branch saturation attempts. % 6.15/1.21 # There were 0 of these attempts blocked. % 6.15/1.21 # There were 0 deferred branch saturation attempts. % 6.15/1.21 # There were 0 free duplicated saturations. % 6.15/1.21 # There were 1 total successful branch saturations. % 6.15/1.21 # There were 0 successful branch saturations in interreduction. % 6.15/1.21 # There were 0 successful branch saturations on the branch. % 6.15/1.21 # There were 1 successful branch saturations after the branch. % 6.15/1.21 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.15/1.21 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.15/1.21 # Begin clausification derivation % 6.15/1.21 % 6.15/1.21 # End clausification derivation % 6.15/1.21 # Begin listing active clauses obtained from FOF to CNF conversion % 6.15/1.21 cnf(i_0_32, hypothesis, (x6!=x14)). % 6.15/1.21 cnf(i_0_33, hypothesis, (x10!=x8)). % 6.15/1.21 cnf(i_0_34, hypothesis, (x4!=x8)). % 6.15/1.21 cnf(i_0_35, hypothesis, (x4!=x7)). % 6.15/1.21 cnf(i_0_36, hypothesis, (x5!=x3)). % 6.15/1.21 cnf(i_0_37, hypothesis, (x9!=x14)). % 6.15/1.21 cnf(i_0_38, hypothesis, (x13!=x14)). % 6.15/1.21 cnf(i_0_22, plain, (sep(lseg(X1,X1),X2)=X2)). % 6.15/1.21 cnf(i_0_21, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))). % 6.15/1.21 cnf(i_0_23, plain, (~heap(sep(next(nil,X1),X2)))). % 6.15/1.21 cnf(i_0_24, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))). % 6.15/1.21 cnf(i_0_25, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))). % 6.15/1.21 cnf(i_0_26, plain, (X1=X3|~heap(sep(next(X1,X2),sep(lseg(X1,X3),X4))))). % 6.15/1.21 cnf(i_0_27, plain, (X1=X3|X1=X2|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))). % 6.15/1.21 cnf(i_0_29, plain, (heap(sep(lseg(X1,nil),X3))|~heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))))). % 6.15/1.21 cnf(i_0_28, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))). % 6.15/1.21 cnf(i_0_30, 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.21 cnf(i_0_31, 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.21 cnf(i_0_39, hypothesis, (heap(sep(lseg(x5,x10),sep(lseg(x13,x12),sep(lseg(x1,x7),sep(lseg(x8,x14),sep(lseg(x12,x8),sep(lseg(x2,x12),sep(lseg(x2,x11),sep(lseg(x9,x14),sep(lseg(x9,x1),sep(lseg(x3,x9),sep(lseg(x11,x13),sep(lseg(x11,x3),emp))))))))))))))). % 6.15/1.21 cnf(i_0_81, plain, (X6=X6)). % 6.15/1.21 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 6.15/1.21 # Begin printing tableau % 6.15/1.21 # Found 6 steps % 6.15/1.21 cnf(i_0_32, hypothesis, (x6!=x14), inference(start_rule)). % 6.15/1.21 cnf(i_0_89, plain, (x6!=x14), inference(extension_rule, [i_0_27])). % 6.15/1.21 cnf(i_0_124, plain, (x6=x14), inference(closure_rule, [i_0_32])). % 6.15/1.21 cnf(i_0_125, plain, (~heap(sep(lseg(x6,x14),sep(lseg(x6,x14),X11)))), inference(extension_rule, [i_0_28])). % 6.15/1.21 cnf(i_0_166, plain, (x6=x14), inference(closure_rule, [i_0_32])). % 6.15/1.21 cnf(i_0_168, plain, (~heap(sep(next(x6,x14),sep(lseg(x14,x14),sep(lseg(x6,x14),X11))))), inference(etableau_closure_rule, [i_0_168, ...])). % 6.15/1.21 # End printing tableau % 6.15/1.21 # SZS output end % 6.15/1.21 # Branches closed with saturation will be marked with an "s" % 6.15/1.21 # There were 1 total branch saturation attempts. % 6.15/1.21 # There were 0 of these attempts blocked. % 6.15/1.21 # There were 0 deferred branch saturation attempts. % 6.15/1.21 # There were 0 free duplicated saturations. % 6.15/1.21 # There were 1 total successful branch saturations. % 6.15/1.21 # There were 0 successful branch saturations in interreduction. % 6.15/1.21 # There were 0 successful branch saturations on the branch. % 6.15/1.21 # There were 1 successful branch saturations after the branch. % 6.15/1.21 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.15/1.21 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.15/1.21 # Begin clausification derivation % 6.15/1.21 % 6.15/1.21 # End clausification derivation % 6.15/1.21 # Begin listing active clauses obtained from FOF to CNF conversion % 6.15/1.21 cnf(i_0_32, hypothesis, (x6!=x14)). % 6.15/1.21 cnf(i_0_33, hypothesis, (x10!=x8)). % 6.15/1.21 cnf(i_0_34, hypothesis, (x4!=x8)). % 6.15/1.21 cnf(i_0_35, hypothesis, (x4!=x7)). % 6.15/1.21 cnf(i_0_36, hypothesis, (x5!=x3)). % 6.15/1.21 cnf(i_0_37, hypothesis, (x9!=x14)). % 6.15/1.21 cnf(i_0_38, hypothesis, (x13!=x14)). % 6.15/1.21 cnf(i_0_22, plain, (sep(lseg(X1,X1),X2)=X2)). % 6.15/1.21 cnf(i_0_21, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))). % 6.15/1.21 cnf(i_0_23, plain, (~heap(sep(next(nil,X1),X2)))). % 6.15/1.21 cnf(i_0_24, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))). % 6.15/1.21 cnf(i_0_25, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))). % 6.15/1.21 cnf(i_0_26, plain, (X1=X3|~heap(sep(next(X1,X2),sep(lseg(X1,X3),X4))))). % 6.15/1.21 cnf(i_0_27, plain, (X1=X3|X1=X2|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))). % 6.15/1.21 cnf(i_0_29, plain, (heap(sep(lseg(X1,nil),X3))|~heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))))). % 6.15/1.22 cnf(i_0_28, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))). % 6.15/1.22 cnf(i_0_30, 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.22 cnf(i_0_31, 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.22 cnf(i_0_39, hypothesis, (heap(sep(lseg(x5,x10),sep(lseg(x13,x12),sep(lseg(x1,x7),sep(lseg(x8,x14),sep(lseg(x12,x8),sep(lseg(x2,x12),sep(lseg(x2,x11),sep(lseg(x9,x14),sep(lseg(x9,x1),sep(lseg(x3,x9),sep(lseg(x11,x13),sep(lseg(x11,x3),emp))))))))))))))). % 6.15/1.22 cnf(i_0_81, plain, (X6=X6)). % 6.15/1.22 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 6.15/1.22 # Begin printing tableau % 6.15/1.22 # Found 6 steps % 6.15/1.22 cnf(i_0_32, hypothesis, (x6!=x14), inference(start_rule)). % 6.15/1.22 cnf(i_0_89, plain, (x6!=x14), inference(extension_rule, [i_0_27])). % 6.15/1.22 cnf(i_0_123, plain, (x6=x14), inference(closure_rule, [i_0_32])). % 6.15/1.22 cnf(i_0_125, plain, (~heap(sep(lseg(x6,x14),sep(lseg(x6,x14),X11)))), inference(extension_rule, [i_0_28])). % 6.15/1.22 cnf(i_0_166, plain, (x6=x14), inference(closure_rule, [i_0_32])). % 6.15/1.22 cnf(i_0_168, plain, (~heap(sep(next(x6,x14),sep(lseg(x14,x14),sep(lseg(x6,x14),X11))))), inference(etableau_closure_rule, [i_0_168, ...])). % 6.15/1.22 # End printing tableau % 6.15/1.22 # SZS output end % 6.15/1.22 # Branches closed with saturation will be marked with an "s" % 6.15/1.22 # Child (10425) has found a proof. % 6.15/1.22 % 6.15/1.22 # Proof search is over... % 6.15/1.22 # Freeing feature tree %------------------------------------------------------------------------------