%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWW442-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 : n025.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:58 EDT 2022 % Result : Unsatisfiable 3.69s 0.84s % Output : CNFRefutation 3.69s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.05/0.13 % Problem : SWW442-1 : TPTP v8.1.0. Released v5.2.0. % 0.15/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 : n025.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 04:49:02 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.39 # No SInE strategy applied % 0.15/0.39 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.15/0.39 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.15/0.39 # % 0.15/0.39 # Number of axioms: 40 Number of unprocessed: 40 % 0.15/0.39 # Tableaux proof search. % 0.15/0.39 # APR header successfully linked. % 0.15/0.39 # Hello from C++ % 0.15/0.39 # The folding up rule is enabled... % 0.15/0.39 # Local unification is enabled... % 0.15/0.39 # Any saturation attempts will use folding labels... % 0.15/0.39 # 40 beginning clauses after preprocessing and clausification % 0.15/0.39 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.15/0.39 # Creating start rules for all 1 conjectures. % 0.15/0.39 # There are 1 start rule candidates: % 0.15/0.39 # Found 33 unit axioms. % 0.15/0.39 # 1 start rule tableaux created. % 0.15/0.39 # 8 extension rule candidate clauses % 0.15/0.39 # 33 unit axiom clauses % 0.15/0.39 % 0.15/0.39 # Requested 8, 32 cores available to the main process. % 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.15/0.39 # Creating equality axioms % 0.15/0.39 # Ran out of tableaux, making start rules for all clauses % 0.15/0.39 # Returning from population with 46 new_tableaux and 0 remaining starting tableaux. % 0.15/0.39 # We now have 46 tableaux to operate on % 3.69/0.84 # There were 1 total branch saturation attempts. % 3.69/0.84 # There were 0 of these attempts blocked. % 3.69/0.84 # There were 0 deferred branch saturation attempts. % 3.69/0.84 # There were 0 free duplicated saturations. % 3.69/0.84 # There were 1 total successful branch saturations. % 3.69/0.84 # There were 0 successful branch saturations in interreduction. % 3.69/0.84 # There were 0 successful branch saturations on the branch. % 3.69/0.84 # There were 1 successful branch saturations after the branch. % 3.69/0.84 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.69/0.84 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.69/0.84 # Begin clausification derivation % 3.69/0.84 % 3.69/0.84 # End clausification derivation % 3.69/0.84 # Begin listing active clauses obtained from FOF to CNF conversion % 3.69/0.84 cnf(i_0_53, hypothesis, (x6!=x13)). % 3.69/0.84 cnf(i_0_54, hypothesis, (x6!=x16)). % 3.69/0.84 cnf(i_0_76, hypothesis, (x18!=x13)). % 3.69/0.84 cnf(i_0_55, hypothesis, (x18!=x11)). % 3.69/0.84 cnf(i_0_56, hypothesis, (x17!=x11)). % 3.69/0.84 cnf(i_0_57, hypothesis, (x3!=x16)). % 3.69/0.84 cnf(i_0_59, hypothesis, (x3!=x17)). % 3.69/0.84 cnf(i_0_58, hypothesis, (x3!=x12)). % 3.69/0.84 cnf(i_0_60, hypothesis, (x7!=x13)). % 3.69/0.84 cnf(i_0_69, hypothesis, (x14!=x12)). % 3.69/0.84 cnf(i_0_61, hypothesis, (x14!=x7)). % 3.69/0.84 cnf(i_0_62, hypothesis, (x7!=x15)). % 3.69/0.84 cnf(i_0_63, hypothesis, (x9!=x13)). % 3.69/0.84 cnf(i_0_64, hypothesis, (x9!=x17)). % 3.69/0.84 cnf(i_0_66, hypothesis, (x6!=x2)). % 3.69/0.84 cnf(i_0_67, hypothesis, (x2!=x11)). % 3.69/0.84 cnf(i_0_68, hypothesis, (x17!=x2)). % 3.69/0.84 cnf(i_0_70, hypothesis, (x8!=x14)). % 3.69/0.84 cnf(i_0_65, hypothesis, (x8!=x2)). % 3.69/0.84 cnf(i_0_72, hypothesis, (x1!=x15)). % 3.69/0.84 cnf(i_0_77, hypothesis, (x10!=x11)). % 3.69/0.84 cnf(i_0_78, hypothesis, (x12!=x10)). % 3.69/0.84 cnf(i_0_71, hypothesis, (x1!=x10)). % 3.69/0.84 cnf(i_0_75, hypothesis, (x4!=x13)). % 3.69/0.84 cnf(i_0_73, hypothesis, (x4!=x11)). % 3.69/0.84 cnf(i_0_74, hypothesis, (x9!=x4)). % 3.69/0.84 cnf(i_0_79, hypothesis, (x5!=x6)). % 3.69/0.84 cnf(i_0_80, hypothesis, (x5!=x16)). % 3.69/0.84 cnf(i_0_43, plain, (sep(lseg(X1,X1),X2)=X2)). % 3.69/0.84 cnf(i_0_42, plain, (sep(X1,sep(X2,X3))=sep(X2,sep(X1,X3)))). % 3.69/0.84 cnf(i_0_44, plain, (~heap(sep(next(nil,X1),X2)))). % 3.69/0.84 cnf(i_0_45, plain, (X1=nil|~heap(sep(lseg(nil,X1),X2)))). % 3.69/0.84 cnf(i_0_46, plain, (~heap(sep(next(X1,X2),sep(next(X1,X3),X4))))). % 3.69/0.84 cnf(i_0_47, plain, (X1=X3|~heap(sep(next(X1,X2),sep(lseg(X1,X3),X4))))). % 3.69/0.84 cnf(i_0_48, plain, (X1=X3|X1=X2|~heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))))). % 3.69/0.84 cnf(i_0_50, plain, (heap(sep(lseg(X1,nil),X3))|~heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))))). % 3.69/0.84 cnf(i_0_49, plain, (X1=X2|heap(sep(lseg(X1,X3),X4))|~heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))))). % 3.69/0.84 cnf(i_0_51, 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.69/0.84 cnf(i_0_52, 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.69/0.84 cnf(i_0_81, hypothesis, (heap(sep(lseg(x5,x14),sep(lseg(x13,x15),sep(lseg(x13,x12),sep(lseg(x13,x2),sep(lseg(x10,x11),sep(lseg(x18,x10),sep(lseg(x18,x11),sep(lseg(x1,x5),sep(lseg(x4,x15),sep(lseg(x4,x11),sep(lseg(x15,x16),sep(lseg(x17,x10),sep(lseg(x2,x16),sep(lseg(x2,x6),sep(lseg(x9,x15),sep(lseg(x7,x12),sep(lseg(x7,x13),sep(lseg(x11,x9),emp))))))))))))))))))))). % 3.69/0.84 cnf(i_0_123, plain, (X6=X6)). % 3.69/0.84 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.69/0.84 # Begin printing tableau % 3.69/0.84 # Found 5 steps % 3.69/0.84 cnf(i_0_76, hypothesis, (x18!=x13), inference(start_rule)). % 3.69/0.84 cnf(i_0_133, plain, (x18!=x13), inference(extension_rule, [i_0_47])). % 3.69/0.84 cnf(i_0_223, plain, (~heap(sep(next(x18,X4),sep(lseg(x18,x13),X3)))), inference(extension_rule, [i_0_130])). % 3.69/0.84 cnf(i_0_259, plain, (~heap(sep(lseg(x5,x14),sep(lseg(x13,x15),sep(lseg(x13,x12),sep(lseg(x13,x2),sep(lseg(x10,x11),sep(lseg(x18,x10),sep(lseg(x18,x11),sep(lseg(x1,x5),sep(lseg(x4,x15),sep(lseg(x4,x11),sep(lseg(x15,x16),sep(lseg(x17,x10),sep(lseg(x2,x16),sep(lseg(x2,x6),sep(lseg(x9,x15),sep(lseg(x7,x12),sep(lseg(x7,x13),sep(lseg(x11,x9),emp)))))))))))))))))))), inference(closure_rule, [i_0_81])). % 3.69/0.84 cnf(i_0_258, plain, (sep(lseg(x5,x14),sep(lseg(x13,x15),sep(lseg(x13,x12),sep(lseg(x13,x2),sep(lseg(x10,x11),sep(lseg(x18,x10),sep(lseg(x18,x11),sep(lseg(x1,x5),sep(lseg(x4,x15),sep(lseg(x4,x11),sep(lseg(x15,x16),sep(lseg(x17,x10),sep(lseg(x2,x16),sep(lseg(x2,x6),sep(lseg(x9,x15),sep(lseg(x7,x12),sep(lseg(x7,x13),sep(lseg(x11,x9),emp))))))))))))))))))!=sep(next(x18,X4),sep(lseg(x18,x13),X3))), inference(etableau_closure_rule, [i_0_258, ...])). % 3.69/0.84 # End printing tableau % 3.69/0.84 # SZS output end % 3.69/0.84 # Branches closed with saturation will be marked with an "s" % 3.69/0.85 # Child (9577) has found a proof. % 3.69/0.85 % 3.69/0.85 # Proof search is over... % 3.69/0.85 # Freeing feature tree %------------------------------------------------------------------------------