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