TSTP Solution File: SYN573-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN573-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 : n026.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:33 EDT 2022
% Result : Unsatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN573-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.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 12 02:19:42 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 21 Number of unprocessed: 21
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 21 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 21 conjectures.
% 0.13/0.38 # There are 21 start rule candidates:
% 0.13/0.38 # Found 5 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 21 start rule tableaux created.
% 0.13/0.38 # 16 extension rule candidate clauses
% 0.13/0.38 # 5 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 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_22, negated_conjecture, (p12(c15))).
% 0.13/0.38 cnf(i_0_23, negated_conjecture, (p4(X1,X1))).
% 0.13/0.38 cnf(i_0_24, negated_conjecture, (p2(X1,X1))).
% 0.13/0.38 cnf(i_0_37, negated_conjecture, (p11(X1,f3(f8(X2),f3(f8(X1),f5(f6(f7(c14)))))))).
% 0.13/0.38 cnf(i_0_40, negated_conjecture, (~p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))))).
% 0.13/0.38 cnf(i_0_35, negated_conjecture, (p11(X1,c16)|p2(X1,f9(c17))|~p12(X1))).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (p12(X1)|~p2(X2,X1)|~p12(X2))).
% 0.13/0.38 cnf(i_0_25, negated_conjecture, (p2(X1,f9(f10(X1)))|~p12(X1))).
% 0.13/0.38 cnf(i_0_33, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.13/0.38 cnf(i_0_34, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.13/0.38 cnf(i_0_31, negated_conjecture, (p4(f10(X1),f10(X2))|~p2(X1,X2))).
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (p4(f7(X1),f7(X2))|~p4(X1,X2))).
% 0.13/0.38 cnf(i_0_32, negated_conjecture, (p4(f6(X1),f6(X2))|~p4(X1,X2))).
% 0.13/0.38 cnf(i_0_36, negated_conjecture, (p13(f10(X1),c17)|p4(f10(X1),c17)|~p12(X1))).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (p2(f9(X1),f9(X2))|~p4(X1,X2))).
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (p2(f5(X1),f5(X2))|~p4(X1,X2))).
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (p2(f8(X1),f8(X2))|~p2(X1,X2))).
% 0.13/0.38 cnf(i_0_38, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.13/0.38 cnf(i_0_39, negated_conjecture, (p13(X1,X2)|~p13(X3,X4)|~p4(X4,X2)|~p4(X3,X1))).
% 0.13/0.38 cnf(i_0_41, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.13/0.38 cnf(i_0_42, negated_conjecture, (p11(X1,f3(f8(X2),f3(f8(X3),f5(f6(f7(c14))))))|~p11(X1,X2))).
% 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 9 steps
% 0.13/0.38 cnf(i_0_38, negated_conjecture, (p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))))|~p11(f9(c17),f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))))|~p2(f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))),f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))))|~p2(f9(c17),c15)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_52, plain, (p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))))), inference(closure_rule, [i_0_40])).
% 0.13/0.38 cnf(i_0_53, plain, (~p11(f9(c17),f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))))), inference(closure_rule, [i_0_37])).
% 0.13/0.38 cnf(i_0_54, plain, (~p2(f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))),f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))))), inference(closure_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_55, plain, (~p2(f9(c17),c15)), inference(extension_rule, [i_0_34])).
% 0.13/0.38 cnf(i_0_119, plain, (~p2(c15,c15)), inference(closure_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_120, plain, (~p2(c15,f9(c17))), inference(extension_rule, [i_0_35])).
% 0.13/0.38 cnf(i_0_159, plain, (~p12(c15)), inference(closure_rule, [i_0_22])).
% 0.13/0.38 cnf(i_0_157, plain, (p11(c15,c16)), inference(etableau_closure_rule, [i_0_157, ...])).
% 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 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 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_22, negated_conjecture, (p12(c15))).
% 0.13/0.38 cnf(i_0_23, negated_conjecture, (p4(X1,X1))).
% 0.13/0.38 cnf(i_0_24, negated_conjecture, (p2(X1,X1))).
% 0.13/0.38 cnf(i_0_37, negated_conjecture, (p11(X1,f3(f8(X2),f3(f8(X1),f5(f6(f7(c14)))))))).
% 0.13/0.38 cnf(i_0_40, negated_conjecture, (~p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))))).
% 0.13/0.38 cnf(i_0_35, negated_conjecture, (p11(X1,c16)|p2(X1,f9(c17))|~p12(X1))).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (p12(X1)|~p2(X2,X1)|~p12(X2))).
% 0.13/0.38 cnf(i_0_25, negated_conjecture, (p2(X1,f9(f10(X1)))|~p12(X1))).
% 0.13/0.38 cnf(i_0_33, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.13/0.38 cnf(i_0_34, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.13/0.38 cnf(i_0_31, negated_conjecture, (p4(f10(X1),f10(X2))|~p2(X1,X2))).
% 0.13/0.38 cnf(i_0_27, negated_conjecture, (p4(f7(X1),f7(X2))|~p4(X1,X2))).
% 0.13/0.38 cnf(i_0_32, negated_conjecture, (p4(f6(X1),f6(X2))|~p4(X1,X2))).
% 0.13/0.38 cnf(i_0_36, negated_conjecture, (p13(f10(X1),c17)|p4(f10(X1),c17)|~p12(X1))).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (p2(f9(X1),f9(X2))|~p4(X1,X2))).
% 0.13/0.38 cnf(i_0_28, negated_conjecture, (p2(f5(X1),f5(X2))|~p4(X1,X2))).
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (p2(f8(X1),f8(X2))|~p2(X1,X2))).
% 0.13/0.38 cnf(i_0_38, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.13/0.38 cnf(i_0_39, negated_conjecture, (p13(X1,X2)|~p13(X3,X4)|~p4(X4,X2)|~p4(X3,X1))).
% 0.13/0.38 cnf(i_0_41, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.13/0.38 cnf(i_0_42, negated_conjecture, (p11(X1,f3(f8(X2),f3(f8(X3),f5(f6(f7(c14))))))|~p11(X1,X2))).
% 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 9 steps
% 0.13/0.38 cnf(i_0_41, negated_conjecture, (p2(f3(f8(f9(c17)),f5(f6(f7(c14)))),f3(f8(f9(c17)),f5(f6(f7(c14)))))|~p2(f5(f6(f7(c14))),f5(f6(f7(c14))))|~p2(f8(f9(c17)),f8(f9(c17)))), inference(start_rule)).
% 0.13/0.38 cnf(i_0_46, plain, (~p2(f5(f6(f7(c14))),f5(f6(f7(c14))))), inference(closure_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_47, plain, (~p2(f8(f9(c17)),f8(f9(c17)))), inference(closure_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_45, plain, (p2(f3(f8(f9(c17)),f5(f6(f7(c14)))),f3(f8(f9(c17)),f5(f6(f7(c14)))))), inference(extension_rule, [i_0_41])).
% 0.13/0.38 cnf(i_0_94, plain, (~p2(f8(c16),f8(c16))), inference(closure_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_92, plain, (p2(f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))),f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))))), inference(extension_rule, [i_0_38])).
% 0.13/0.38 cnf(i_0_101, plain, (p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))))), inference(closure_rule, [i_0_40])).
% 0.13/0.38 cnf(i_0_102, plain, (~p11(f9(c17),f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14))))))), inference(closure_rule, [i_0_37])).
% 0.13/0.38 cnf(i_0_104, plain, (~p2(f9(c17),c15)), inference(etableau_closure_rule, [i_0_104, ...])).
% 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.39 # Child (13732) has found a proof.
% 0.13/0.39
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------