TSTP Solution File: SYN624-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN624-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 : n025.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:54 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SYN624-1 : TPTP v8.1.0. Released v2.5.0.
% 0.09/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 : n025.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 : Tue Jul 12 07:35:03 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 14 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 # 21 extension rule candidate clauses
% 0.13/0.36 # 14 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.41 # There were 1 total branch saturation attempts.
% 0.19/0.41 # There were 0 of these attempts blocked.
% 0.19/0.41 # There were 0 deferred branch saturation attempts.
% 0.19/0.41 # There were 0 free duplicated saturations.
% 0.19/0.41 # There were 1 total successful branch saturations.
% 0.19/0.41 # There were 0 successful branch saturations in interreduction.
% 0.19/0.41 # There were 0 successful branch saturations on the branch.
% 0.19/0.41 # There were 1 successful branch saturations after the branch.
% 0.19/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 # Begin clausification derivation
% 0.19/0.41
% 0.19/0.41 # End clausification derivation
% 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.41 cnf(i_0_43, negated_conjecture, (p3(f4(c22),c23))).
% 0.19/0.41 cnf(i_0_44, negated_conjecture, (p19(f7(f8(f9(c25))),c23))).
% 0.19/0.41 cnf(i_0_36, negated_conjecture, (p10(X1,X1))).
% 0.19/0.41 cnf(i_0_37, negated_conjecture, (p5(X1,X1))).
% 0.19/0.41 cnf(i_0_38, negated_conjecture, (p3(X1,X1))).
% 0.19/0.41 cnf(i_0_39, negated_conjecture, (p2(X1,X1))).
% 0.19/0.41 cnf(i_0_40, negated_conjecture, (p11(X1,X1))).
% 0.19/0.41 cnf(i_0_46, negated_conjecture, (p10(f16(X1,f14(f15(f7(c25)))),X1))).
% 0.19/0.41 cnf(i_0_62, negated_conjecture, (p20(f12(f13(f6(c24),c26)),f12(f13(f6(c24),X1))))).
% 0.19/0.41 cnf(i_0_61, negated_conjecture, (p10(f13(f6(c22),X1),f13(f6(c24),f16(c26,X1))))).
% 0.19/0.41 cnf(i_0_41, negated_conjecture, (~p18(f6(c24)))).
% 0.19/0.41 cnf(i_0_42, negated_conjecture, (~p18(f6(c22)))).
% 0.19/0.41 cnf(i_0_55, negated_conjecture, (~p10(f13(f6(c24),c26),f14(f15(f7(c25)))))).
% 0.19/0.41 cnf(i_0_63, negated_conjecture, (~p10(f13(f6(c24),c26),f13(f6(c22),f14(f15(f7(c25))))))).
% 0.19/0.41 cnf(i_0_45, negated_conjecture, (p18(X1)|~p18(X2)|~p5(X2,X1))).
% 0.19/0.41 cnf(i_0_47, negated_conjecture, (p10(f14(X1),f14(X2))|~p11(X1,X2))).
% 0.19/0.41 cnf(i_0_48, negated_conjecture, (p5(f6(X1),f6(X2))|~p2(X1,X2))).
% 0.19/0.41 cnf(i_0_52, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.19/0.41 cnf(i_0_56, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.19/0.41 cnf(i_0_57, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.19/0.41 cnf(i_0_58, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.19/0.41 cnf(i_0_59, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.19/0.41 cnf(i_0_49, negated_conjecture, (p3(f9(X1),f9(X2))|~p3(X1,X2))).
% 0.19/0.41 cnf(i_0_50, negated_conjecture, (p3(f8(X1),f8(X2))|~p3(X1,X2))).
% 0.19/0.41 cnf(i_0_51, negated_conjecture, (p3(f7(X1),f7(X2))|~p3(X1,X2))).
% 0.19/0.41 cnf(i_0_53, negated_conjecture, (p11(f15(X1),f15(X2))|~p3(X1,X2))).
% 0.19/0.41 cnf(i_0_54, negated_conjecture, (p11(f12(X1),f12(X2))|~p10(X1,X2))).
% 0.19/0.41 cnf(i_0_60, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))).
% 0.19/0.41 cnf(i_0_69, negated_conjecture, (p10(f16(X1,X2),f16(X3,X4))|~p10(X2,X4)|~p10(X1,X3))).
% 0.19/0.41 cnf(i_0_65, negated_conjecture, (p19(X1,X2)|~p19(X3,X4)|~p3(X4,X2)|~p3(X3,X1))).
% 0.19/0.41 cnf(i_0_66, negated_conjecture, (p20(X1,X2)|~p20(X3,X4)|~p11(X3,X1)|~p11(X4,X2))).
% 0.19/0.41 cnf(i_0_64, negated_conjecture, (p21(X1,X2)|~p21(X3,X4)|~p3(X4,X2)|~p3(X3,X1))).
% 0.19/0.41 cnf(i_0_67, negated_conjecture, (p10(f13(X1,X2),f13(X3,X4))|~p5(X1,X3)|~p10(X2,X4))).
% 0.19/0.41 cnf(i_0_68, negated_conjecture, (p10(f17(X1,X2),f17(X3,X4))|~p2(X2,X4)|~p3(X1,X3))).
% 0.19/0.41 cnf(i_0_70, negated_conjecture, (p18(f6(X1))|p10(f13(f6(X1),f17(X2,X1)),f14(f15(f7(c25))))|~p21(X2,c23)|~p3(f4(X1),X2))).
% 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.41 # Begin printing tableau
% 0.19/0.41 # Found 8 steps
% 0.19/0.41 cnf(i_0_59, negated_conjecture, (p2(X13,X13)|~p2(X13,X13)|~p2(X13,X13)), inference(start_rule)).
% 0.19/0.41 cnf(i_0_110, plain, (~p2(X13,X13)), inference(closure_rule, [i_0_39])).
% 0.19/0.41 cnf(i_0_111, plain, (~p2(X13,X13)), inference(closure_rule, [i_0_39])).
% 0.19/0.41 cnf(i_0_109, plain, (p2(X13,X13)), inference(extension_rule, [i_0_68])).
% 0.19/0.41 cnf(i_0_1035, plain, (~p3(X14,X14)), inference(closure_rule, [i_0_38])).
% 0.19/0.41 cnf(i_0_1033, plain, (p10(f17(X14,X13),f17(X14,X13))), inference(extension_rule, [i_0_67])).
% 0.19/0.41 cnf(i_0_1041, plain, (~p5(X7,X7)), inference(closure_rule, [i_0_37])).
% 0.19/0.41 cnf(i_0_1040, plain, (p10(f13(X7,f17(X14,X13)),f13(X7,f17(X14,X13)))), inference(etableau_closure_rule, [i_0_1040, ...])).
% 0.19/0.41 # End printing tableau
% 0.19/0.41 # SZS output end
% 0.19/0.41 # Branches closed with saturation will be marked with an "s"
% 0.19/0.42 # Child (32262) has found a proof.
% 0.19/0.42
% 0.19/0.42 # Proof search is over...
% 0.19/0.42 # Freeing feature tree
%------------------------------------------------------------------------------