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