%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN565-1 : TPTP v8.1.0. Released v2.5.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 : n011.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 06:12:30 EDT 2022 % Result : Unsatisfiable 0.21s 0.49s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN565-1 : TPTP v8.1.0. Released v2.5.0. % 0.03/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 : n011.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 : Mon Jul 11 19:37:57 EDT 2022 % 0.13/0.34 % CPUTime : % 0.21/0.37 # No SInE strategy applied % 0.21/0.37 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I % 0.21/0.37 # and selection function SelectCQArEqLast. % 0.21/0.37 # % 0.21/0.37 # Presaturation interreduction done % 0.21/0.37 # Number of axioms: 18 Number of unprocessed: 18 % 0.21/0.37 # Tableaux proof search. % 0.21/0.37 # APR header successfully linked. % 0.21/0.37 # Hello from C++ % 0.21/0.37 # The folding up rule is enabled... % 0.21/0.37 # Local unification is enabled... % 0.21/0.37 # Any saturation attempts will use folding labels... % 0.21/0.37 # 18 beginning clauses after preprocessing and clausification % 0.21/0.37 # Creating start rules for all 18 conjectures. % 0.21/0.37 # There are 18 start rule candidates: % 0.21/0.37 # Found 7 unit axioms. % 0.21/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.21/0.37 # 18 start rule tableaux created. % 0.21/0.37 # 11 extension rule candidate clauses % 0.21/0.37 # 7 unit axiom clauses % 0.21/0.37 % 0.21/0.37 # Requested 8, 32 cores available to the main process. % 0.21/0.49 # There were 1 total branch saturation attempts. % 0.21/0.49 # There were 0 of these attempts blocked. % 0.21/0.49 # There were 0 deferred branch saturation attempts. % 0.21/0.49 # There were 0 free duplicated saturations. % 0.21/0.49 # There were 1 total successful branch saturations. % 0.21/0.49 # There were 0 successful branch saturations in interreduction. % 0.21/0.49 # There were 0 successful branch saturations on the branch. % 0.21/0.49 # There were 1 successful branch saturations after the branch. % 0.21/0.49 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.49 # Begin clausification derivation % 0.21/0.49 % 0.21/0.49 # End clausification derivation % 0.21/0.49 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.49 cnf(i_0_19, negated_conjecture, (p2(X1,X1))). % 0.21/0.49 cnf(i_0_20, negated_conjecture, (p4(X1,X1))). % 0.21/0.49 cnf(i_0_21, negated_conjecture, (p2(f5(f7(X1)),f5(X1)))). % 0.21/0.49 cnf(i_0_22, negated_conjecture, (p4(f8(X1,X2),f6(X1,f7(X2))))). % 0.21/0.49 cnf(i_0_23, negated_conjecture, (p4(f7(f8(X1,X2)),f8(X2,X1)))). % 0.21/0.49 cnf(i_0_28, negated_conjecture, (p10(f5(X1),f3(f5(f6(X1,X2)),f5(X2))))). % 0.21/0.49 cnf(i_0_29, negated_conjecture, (~p10(f9(f5(c11),f5(c12)),f5(f8(c12,c11))))). % 0.21/0.49 cnf(i_0_24, negated_conjecture, (p2(f5(X1),f5(X2))|~p4(X1,X2))). % 0.21/0.49 cnf(i_0_25, negated_conjecture, (p4(f7(X1),f7(X2))|~p4(X1,X2))). % 0.21/0.49 cnf(i_0_26, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.21/0.49 cnf(i_0_27, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.21/0.49 cnf(i_0_30, negated_conjecture, (p10(X1,f3(X2,X3))|~p10(f9(X1,X3),X2))). % 0.21/0.49 cnf(i_0_31, negated_conjecture, (p10(f9(X1,X2),X3)|~p10(X1,f3(X3,X2)))). % 0.21/0.49 cnf(i_0_32, negated_conjecture, (p10(X1,X2)|~p10(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.21/0.49 cnf(i_0_34, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.21/0.49 cnf(i_0_35, negated_conjecture, (p2(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.21/0.49 cnf(i_0_33, negated_conjecture, (p4(f8(X1,X2),f8(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.21/0.49 cnf(i_0_36, negated_conjecture, (p4(f6(X1,X2),f6(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.21/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.49 # Begin printing tableau % 0.21/0.49 # Found 8 steps % 0.21/0.49 cnf(i_0_31, negated_conjecture, (p10(f9(f5(c11),f5(c12)),f5(f8(c12,c11)))|~p10(f5(c11),f3(f5(f8(c12,c11)),f5(c12)))), inference(start_rule)). % 0.21/0.49 cnf(i_0_53, plain, (p10(f9(f5(c11),f5(c12)),f5(f8(c12,c11)))), inference(closure_rule, [i_0_29])). % 0.21/0.49 cnf(i_0_54, plain, (~p10(f5(c11),f3(f5(f8(c12,c11)),f5(c12)))), inference(extension_rule, [i_0_32])). % 0.21/0.49 cnf(i_0_87, plain, (~p10(f5(f7(c11)),f3(f5(f6(f7(c11),f7(c12))),f5(f7(c12))))), inference(closure_rule, [i_0_28])). % 0.21/0.49 cnf(i_0_89, plain, (~p2(f5(f7(c11)),f5(c11))), inference(closure_rule, [i_0_21])). % 0.21/0.49 cnf(i_0_88, plain, (~p2(f3(f5(f6(f7(c11),f7(c12))),f5(f7(c12))),f3(f5(f8(c12,c11)),f5(c12)))), inference(extension_rule, [i_0_34])). % 0.21/0.49 cnf(i_0_100, plain, (~p2(f5(f7(c12)),f5(c12))), inference(closure_rule, [i_0_21])). % 0.21/0.49 cnf(i_0_101, plain, (~p2(f5(f6(f7(c11),f7(c12))),f5(f8(c12,c11)))), inference(etableau_closure_rule, [i_0_101, ...])). % 0.21/0.49 # End printing tableau % 0.21/0.49 # SZS output end % 0.21/0.49 # Branches closed with saturation will be marked with an "s" % 0.21/0.49 # Child (11472) has found a proof. % 0.21/0.49 % 0.21/0.49 # Proof search is over... % 0.21/0.49 # Freeing feature tree %------------------------------------------------------------------------------