%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWW412-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 : n023.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:54 EDT 2022 % Result : Unsatisfiable 0.20s 0.52s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWW412-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.12/0.34 % Computer : n023.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sat Jun 4 10:50:40 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 20 Number of unprocessed: 20 % 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.51 # The folding up rule is enabled... % 0.20/0.51 # Local unification is enabled... % 0.20/0.51 # Any saturation attempts will use folding labels... % 0.20/0.51 # 20 beginning clauses after preprocessing and clausification % 0.20/0.51 # Creating start rules for all 1 conjectures. % 0.20/0.51 # There are 1 start rule candidates: % 0.20/0.51 # Found 13 unit axioms. % 0.20/0.51 # 1 start rule tableaux created. % 0.20/0.51 # 7 extension rule candidate clauses % 0.20/0.51 # 13 unit axiom clauses % 0.20/0.51 % 0.20/0.51 # Requested 8, 32 cores available to the main process. % 0.20/0.51 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.52 # There were 1 total branch saturation attempts. % 0.20/0.52 # There were 0 of these attempts blocked. % 0.20/0.52 # There were 0 deferred branch saturation attempts. % 0.20/0.52 # There were 0 free duplicated saturations. % 0.20/0.52 # There were 1 total successful branch saturations. % 0.20/0.52 # There were 0 successful branch saturations in interreduction. % 0.20/0.52 # There were 0 successful branch saturations on the branch. % 0.20/0.52 # There were 1 successful branch saturations after the branch. % 0.20/0.52 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.52 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.52 # Begin clausification derivation % 0.20/0.52 % 0.20/0.52 # End clausification derivation % 0.20/0.52 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.52 cnf(i_0_22, plain, (sep(lseg(X1,X1),X2)=X2)). % 0.20/0.52 cnf(i_0_39, hypothesis, (heap(sep(lseg(x3,nil),sep(lseg(x4,nil),sep(next(x1,x4),sep(next(x2,x3),emp))))))). % 0.20/0.52 cnf(i_0_21, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))). % 0.20/0.52 cnf(i_0_32, hypothesis, (x1!=nil)). % 0.20/0.52 cnf(i_0_33, hypothesis, (x2!=nil)). % 0.20/0.52 cnf(i_0_36, hypothesis, (x2!=x1)). % 0.20/0.52 cnf(i_0_34, hypothesis, (x3!=x1)). % 0.20/0.52 cnf(i_0_35, hypothesis, (x3!=x2)). % 0.20/0.52 cnf(i_0_37, hypothesis, (x4!=x1)). % 0.20/0.52 cnf(i_0_38, hypothesis, (x4!=x2)). % 0.20/0.52 cnf(i_0_23, plain, (~heap(sep(next(nil,X1),X2)))). % 0.20/0.52 cnf(i_0_25, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))). % 0.20/0.52 cnf(i_0_40, negated_conjecture, (~heap(sep(lseg(x1,nil),sep(lseg(x2,nil),emp))))). % 0.20/0.52 cnf(i_0_24, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))). % 0.20/0.52 cnf(i_0_29, plain, (heap(sep(lseg(X1,nil),X2))|~heap(sep(lseg(X1,X3),sep(lseg(X3,nil),X2))))). % 0.20/0.52 cnf(i_0_26, plain, (X1=X2|~heap(sep(next(X1,X3),sep(lseg(X1,X2),X4))))). % 0.20/0.52 cnf(i_0_27, plain, (X1=X2|X1=X3|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))). % 0.20/0.52 cnf(i_0_28, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))). % 0.20/0.52 cnf(i_0_30, 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.20/0.52 cnf(i_0_31, 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.20/0.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.52 # Begin printing tableau % 0.20/0.52 # Found 4 steps % 0.20/0.52 cnf(i_0_40, negated_conjecture, (~heap(sep(lseg(x1,nil),sep(lseg(x2,nil),emp)))), inference(start_rule)). % 0.20/0.52 cnf(i_0_41, plain, (~heap(sep(lseg(x1,nil),sep(lseg(x2,nil),emp)))), inference(extension_rule, [i_0_29])). % 0.20/0.52 cnf(i_0_45, plain, (~heap(sep(lseg(x1,nil),sep(lseg(nil,nil),sep(lseg(x2,nil),emp))))), inference(extension_rule, [i_0_29])). % 0.20/0.52 cnf(i_0_79, plain, (~heap(sep(lseg(x1,X7),sep(lseg(X7,nil),sep(lseg(nil,nil),sep(lseg(x2,nil),emp)))))), inference(etableau_closure_rule, [i_0_79, ...])). % 0.20/0.52 # End printing tableau % 0.20/0.52 # SZS output end % 0.20/0.52 # Branches closed with saturation will be marked with an "s" % 0.20/0.52 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.20/0.52 # We now have 1 tableaux to operate on % 0.20/0.52 # Found closed tableau during pool population. % 0.20/0.52 # Proof search is over... % 0.20/0.52 # Freeing feature tree %------------------------------------------------------------------------------