TSTP Solution File: SYN589-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN589-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 : n007.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:39 EDT 2022
% Result : Unsatisfiable 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN589-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 13:47:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 26 Number of unprocessed: 26
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 26 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 26 conjectures.
% 0.12/0.36 # There are 26 start rule candidates:
% 0.12/0.36 # Found 12 unit axioms.
% 0.12/0.36 # Closed tableau found in foldup close cycle with 0 folds and 3 closures done.
% 0.12/0.36 # Found closed tableau while making start rule
% 0.12/0.36 # There were 0 total branch saturation attempts.
% 0.12/0.36 # There were 0 of these attempts blocked.
% 0.12/0.36 # There were 0 deferred branch saturation attempts.
% 0.12/0.36 # There were 0 free duplicated saturations.
% 0.12/0.36 # There were 0 total successful branch saturations.
% 0.12/0.36 # There were 0 successful branch saturations in interreduction.
% 0.12/0.36 # There were 0 successful branch saturations on the branch.
% 0.12/0.36 # There were 0 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.36 # Begin clausification derivation
% 0.12/0.36
% 0.12/0.36 # End clausification derivation
% 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.36 cnf(i_0_29, negated_conjecture, (p2(c21,f3(c17)))).
% 0.12/0.36 cnf(i_0_31, negated_conjecture, (p14(c18,f3(f4(f5(c17)))))).
% 0.12/0.36 cnf(i_0_32, negated_conjecture, (p14(c23,f3(f4(f5(c17)))))).
% 0.12/0.36 cnf(i_0_33, negated_conjecture, (p14(c19,f6(f3(f4(f5(c17))),c16)))).
% 0.12/0.36 cnf(i_0_27, negated_conjecture, (p2(X1,X1))).
% 0.12/0.36 cnf(i_0_28, negated_conjecture, (p7(X1,X1))).
% 0.12/0.36 cnf(i_0_34, negated_conjecture, (p14(c24,f6(f3(f4(f5(c17))),c16)))).
% 0.12/0.36 cnf(i_0_42, negated_conjecture, (p15(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c24))).
% 0.12/0.36 cnf(i_0_51, negated_conjecture, (p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))))).
% 0.12/0.36 cnf(i_0_50, negated_conjecture, (p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22))))))).
% 0.12/0.36 cnf(i_0_30, negated_conjecture, (~p2(c16,f3(c17)))).
% 0.12/0.36 cnf(i_0_52, negated_conjecture, (~p7(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22))))))).
% 0.12/0.36 cnf(i_0_41, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.12/0.36 cnf(i_0_40, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.12/0.36 cnf(i_0_36, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))).
% 0.12/0.36 cnf(i_0_38, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))).
% 0.12/0.36 cnf(i_0_37, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.12/0.36 cnf(i_0_35, negated_conjecture, (p7(f12(X1),f12(X2))|~p7(X1,X2))).
% 0.12/0.36 cnf(i_0_39, negated_conjecture, (p7(f11(X1),f11(X2))|~p2(X1,X2))).
% 0.12/0.36 cnf(i_0_43, negated_conjecture, (p14(X1,X2)|~p14(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.12/0.36 cnf(i_0_44, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.12/0.36 cnf(i_0_49, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.12/0.36 cnf(i_0_45, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.12/0.36 cnf(i_0_46, negated_conjecture, (p7(f9(X1,X2),f9(X3,X4))|~p7(X2,X4)|~p7(X1,X3))).
% 0.12/0.36 cnf(i_0_47, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p7(X2,X4)|~p7(X1,X3))).
% 0.12/0.36 cnf(i_0_48, negated_conjecture, (p7(f10(X1,X2),f10(X3,X4))|~p7(X1,X3)|~p2(X2,X4))).
% 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.36 # Begin printing tableau
% 0.12/0.36 # Found 4 steps
% 0.12/0.36 cnf(i_0_40, negated_conjecture, (p7(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22)))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22)))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(start_rule)).
% 0.12/0.36 cnf(i_0_86, plain, (p7(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_52])).
% 0.12/0.36 cnf(i_0_87, plain, (~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_50])).
% 0.12/0.36 cnf(i_0_88, plain, (~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_51])).
% 0.12/0.36 # End printing tableau
% 0.12/0.36 # SZS output end
% 0.12/0.36 # Branches closed with saturation will be marked with an "s"
% 0.12/0.36 # NOT attempting initial tableau saturation
% 0.12/0.36 # 13 start rule tableaux created.
% 0.12/0.36 # 14 extension rule candidate clauses
% 0.12/0.36 # 12 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Proof search is over...
% 0.12/0.36 # Freeing feature tree
%------------------------------------------------------------------------------