TSTP Solution File: SYN626-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN626-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 : n022.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:55 EDT 2022
% Result : Unsatisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN626-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 18:20:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 35 Number of unprocessed: 35
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 35 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 35 conjectures.
% 0.13/0.36 # There are 35 start rule candidates:
% 0.13/0.36 # Found 10 unit axioms.
% 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.36 # 35 start rule tableaux created.
% 0.13/0.36 # 25 extension rule candidate clauses
% 0.13/0.36 # 10 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There were 1 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 1 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 1 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_36, negated_conjecture, (p11(X1,X1))).
% 0.13/0.37 cnf(i_0_42, negated_conjecture, (p14(f4(f5(c20)),f4(c21)))).
% 0.13/0.37 cnf(i_0_44, negated_conjecture, (p15(c22,f8(f5(c20),f9(c23,c24))))).
% 0.13/0.37 cnf(i_0_67, negated_conjecture, (p3(f10(c22,f12(f13(f8(f5(c20),f9(c23,c24))))),f4(c21)))).
% 0.13/0.37 cnf(i_0_37, negated_conjecture, (p7(X1,X1))).
% 0.13/0.37 cnf(i_0_38, negated_conjecture, (p6(X1,X1))).
% 0.13/0.37 cnf(i_0_39, negated_conjecture, (p3(X1,X1))).
% 0.13/0.37 cnf(i_0_40, negated_conjecture, (p2(X1,X1))).
% 0.13/0.37 cnf(i_0_41, negated_conjecture, (p11(f13(f12(X1)),X1))).
% 0.13/0.37 cnf(i_0_59, negated_conjecture, (~p15(c22,f12(f13(f8(f5(c20),f9(c23,c24))))))).
% 0.13/0.37 cnf(i_0_43, negated_conjecture, (p16(X1,X2)|~p15(X1,X2))).
% 0.13/0.37 cnf(i_0_56, negated_conjecture, (p15(X1,X2)|~p19(X1,X2)|~p16(X1,X2))).
% 0.13/0.37 cnf(i_0_45, negated_conjecture, (p16(c22,X1)|~p7(f12(f13(X1)),X1))).
% 0.13/0.37 cnf(i_0_50, negated_conjecture, (p7(f12(f13(X1)),X1)|~p16(c22,X1))).
% 0.13/0.37 cnf(i_0_46, negated_conjecture, (p11(f13(X1),f13(X2))|~p7(X1,X2))).
% 0.13/0.37 cnf(i_0_47, negated_conjecture, (p7(f12(X1),f12(X2))|~p11(X1,X2))).
% 0.13/0.37 cnf(i_0_48, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.13/0.37 cnf(i_0_49, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))).
% 0.13/0.37 cnf(i_0_57, negated_conjecture, (p15(X1,X2)|~p18(X1,X2)|~p16(X1,X2))).
% 0.13/0.37 cnf(i_0_58, negated_conjecture, (p15(X1,X2)|~p17(X1,X2)|~p16(X1,X2))).
% 0.13/0.37 cnf(i_0_51, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))).
% 0.13/0.37 cnf(i_0_52, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.13/0.37 cnf(i_0_53, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.13/0.37 cnf(i_0_54, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.13/0.37 cnf(i_0_55, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.13/0.37 cnf(i_0_60, negated_conjecture, (p17(X1,X2)|p18(X1,X2)|p19(X1,X2)|~p15(X1,X2))).
% 0.13/0.37 cnf(i_0_68, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p2(X1,X3)|~p6(X2,X4))).
% 0.13/0.37 cnf(i_0_61, negated_conjecture, (p14(X1,X2)|~p14(X3,X4)|~p3(X4,X2)|~p3(X3,X1))).
% 0.13/0.37 cnf(i_0_70, negated_conjecture, (p6(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.13/0.37 cnf(i_0_65, negated_conjecture, (p16(X1,X2)|~p16(X3,X4)|~p6(X3,X1)|~p7(X4,X2))).
% 0.13/0.37 cnf(i_0_66, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p6(X3,X1)|~p7(X4,X2))).
% 0.13/0.37 cnf(i_0_62, negated_conjecture, (p19(X1,X2)|~p19(X3,X4)|~p6(X3,X1)|~p7(X4,X2))).
% 0.13/0.37 cnf(i_0_63, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p6(X3,X1)|~p7(X4,X2))).
% 0.13/0.37 cnf(i_0_69, negated_conjecture, (p3(f10(X1,X2),f10(X3,X4))|~p6(X1,X3)|~p7(X2,X4))).
% 0.13/0.37 cnf(i_0_64, negated_conjecture, (p17(X1,X2)|~p17(X3,X4)|~p6(X3,X1)|~p7(X4,X2))).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 8 steps
% 0.13/0.37 cnf(i_0_66, negated_conjecture, (p15(c22,f12(f13(f8(f5(c20),f9(c23,c24)))))|~p15(c22,f8(f5(c20),f9(c23,c24)))|~p6(c22,c22)|~p7(f8(f5(c20),f9(c23,c24)),f12(f13(f8(f5(c20),f9(c23,c24)))))), inference(start_rule)).
% 0.13/0.37 cnf(i_0_86, plain, (p15(c22,f12(f13(f8(f5(c20),f9(c23,c24)))))), inference(closure_rule, [i_0_59])).
% 0.13/0.37 cnf(i_0_87, plain, (~p15(c22,f8(f5(c20),f9(c23,c24)))), inference(closure_rule, [i_0_44])).
% 0.13/0.37 cnf(i_0_88, plain, (~p6(c22,c22)), inference(closure_rule, [i_0_38])).
% 0.13/0.37 cnf(i_0_89, plain, (~p7(f8(f5(c20),f9(c23,c24)),f12(f13(f8(f5(c20),f9(c23,c24)))))), inference(extension_rule, [i_0_52])).
% 0.13/0.37 cnf(i_0_203, plain, (~p7(f12(f13(f8(f5(c20),f9(c23,c24)))),f12(f13(f8(f5(c20),f9(c23,c24)))))), inference(closure_rule, [i_0_37])).
% 0.13/0.37 cnf(i_0_204, plain, (~p7(f12(f13(f8(f5(c20),f9(c23,c24)))),f8(f5(c20),f9(c23,c24)))), inference(extension_rule, [i_0_50])).
% 0.13/0.37 cnf(i_0_269, plain, (~p16(c22,f8(f5(c20),f9(c23,c24)))), inference(etableau_closure_rule, [i_0_269, ...])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # Child (5225) has found a proof.
% 0.13/0.37
% 0.13/0.37 # Proof search is over...
% 0.13/0.37 # Freeing feature tree
%------------------------------------------------------------------------------