TSTP Solution File: SYN672-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN672-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 : n013.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:13:13 EDT 2022
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN672-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/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 : n013.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 : Tue Jul 12 00:28:29 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: 54 Number of unprocessed: 54
% 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.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 # 54 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 54 conjectures.
% 0.12/0.37 # There are 54 start rule candidates:
% 0.12/0.37 # Found 22 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 54 start rule tableaux created.
% 0.12/0.37 # 32 extension rule candidate clauses
% 0.12/0.37 # 22 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.49 # There were 1 total branch saturation attempts.
% 0.19/0.49 # There were 0 of these attempts blocked.
% 0.19/0.49 # There were 0 deferred branch saturation attempts.
% 0.19/0.49 # There were 0 free duplicated saturations.
% 0.19/0.49 # There were 1 total successful branch saturations.
% 0.19/0.49 # There were 0 successful branch saturations in interreduction.
% 0.19/0.49 # There were 0 successful branch saturations on the branch.
% 0.19/0.49 # There were 1 successful branch saturations after the branch.
% 0.19/0.49 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 # Begin clausification derivation
% 0.19/0.49
% 0.19/0.49 # End clausification derivation
% 0.19/0.49 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.49 cnf(i_0_55, negated_conjecture, (p11(X1,X1))).
% 0.19/0.49 cnf(i_0_73, negated_conjecture, (p31(f20(c36,c39),f17(c37,c40)))).
% 0.19/0.49 cnf(i_0_56, negated_conjecture, (p9(X1,X1))).
% 0.19/0.49 cnf(i_0_57, negated_conjecture, (p8(X1,X1))).
% 0.19/0.49 cnf(i_0_58, negated_conjecture, (p6(X1,X1))).
% 0.19/0.49 cnf(i_0_59, negated_conjecture, (p5(X1,X1))).
% 0.19/0.49 cnf(i_0_60, negated_conjecture, (p3(X1,X1))).
% 0.19/0.49 cnf(i_0_61, negated_conjecture, (p28(X1,X1))).
% 0.19/0.49 cnf(i_0_62, negated_conjecture, (p26(X1,X1))).
% 0.19/0.49 cnf(i_0_63, negated_conjecture, (p24(X1,X1))).
% 0.19/0.49 cnf(i_0_64, negated_conjecture, (p22(X1,X1))).
% 0.19/0.49 cnf(i_0_65, negated_conjecture, (p21(X1,X1))).
% 0.19/0.49 cnf(i_0_66, negated_conjecture, (p2(X1,X1))).
% 0.19/0.49 cnf(i_0_67, negated_conjecture, (p19(X1,X1))).
% 0.19/0.49 cnf(i_0_68, negated_conjecture, (p18(X1,X1))).
% 0.19/0.49 cnf(i_0_69, negated_conjecture, (p16(X1,X1))).
% 0.19/0.49 cnf(i_0_70, negated_conjecture, (p15(X1,X1))).
% 0.19/0.49 cnf(i_0_71, negated_conjecture, (p13(X1,X1))).
% 0.19/0.49 cnf(i_0_91, negated_conjecture, (p3(f4(f7(c34,X1),f14(c38,X2)),f14(X1,X2)))).
% 0.19/0.49 cnf(i_0_106, negated_conjecture, (p3(f4(f7(c34,X1),f23(f29(c41,X2),X3)),f23(f29(c41,X2),f25(f27(c42,f7(c34,X1)),X3))))).
% 0.19/0.49 cnf(i_0_72, negated_conjecture, (~p3(c40,f14(c38,c39)))).
% 0.19/0.49 cnf(i_0_94, negated_conjecture, (~p30(f10(f12(c32,c33),f14(c35,c39)),f4(f7(c34,c35),c40)))).
% 0.19/0.49 cnf(i_0_74, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))).
% 0.19/0.49 cnf(i_0_75, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.19/0.49 cnf(i_0_108, negated_conjecture, (p30(f10(f12(c32,c33),f4(f7(c34,c35),X1)),f4(f7(c34,c35),X2))|~p30(f10(f12(c32,c33),X1),X2))).
% 0.19/0.49 cnf(i_0_76, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))).
% 0.19/0.49 cnf(i_0_77, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.19/0.49 cnf(i_0_78, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.19/0.49 cnf(i_0_79, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.19/0.49 cnf(i_0_80, negated_conjecture, (p28(X1,X2)|~p28(X3,X2)|~p28(X3,X1))).
% 0.19/0.49 cnf(i_0_81, negated_conjecture, (p26(X1,X2)|~p26(X3,X2)|~p26(X3,X1))).
% 0.19/0.49 cnf(i_0_82, negated_conjecture, (p24(X1,X2)|~p24(X3,X2)|~p24(X3,X1))).
% 0.19/0.49 cnf(i_0_83, negated_conjecture, (p22(X1,X2)|~p22(X3,X2)|~p22(X3,X1))).
% 0.19/0.49 cnf(i_0_84, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))).
% 0.19/0.49 cnf(i_0_85, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.19/0.49 cnf(i_0_86, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))).
% 0.19/0.49 cnf(i_0_87, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))).
% 0.19/0.49 cnf(i_0_88, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))).
% 0.19/0.49 cnf(i_0_89, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))).
% 0.19/0.49 cnf(i_0_90, negated_conjecture, (p13(X1,X2)|~p13(X3,X2)|~p13(X3,X1))).
% 0.19/0.49 cnf(i_0_96, negated_conjecture, (p9(f10(X1,X2),f10(X3,X4))|~p3(X2,X4)|~p8(X1,X3))).
% 0.19/0.49 cnf(i_0_92, negated_conjecture, (p31(X1,X2)|~p31(X3,X4)|~p16(X4,X2)|~p19(X3,X1))).
% 0.19/0.49 cnf(i_0_93, negated_conjecture, (p30(X1,X2)|~p30(X3,X4)|~p3(X4,X2)|~p9(X3,X1))).
% 0.19/0.49 cnf(i_0_97, negated_conjecture, (p8(f12(X1,X2),f12(X3,X4))|~p8(X2,X4)|~p11(X1,X3))).
% 0.19/0.49 cnf(i_0_100, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p13(X2,X4)|~p6(X1,X3))).
% 0.19/0.49 cnf(i_0_98, negated_conjecture, (p3(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.19/0.49 cnf(i_0_107, negated_conjecture, (p30(f10(f12(c32,c33),f14(c38,X1)),X2)|p3(X2,f14(c38,X1))|~p31(f20(c36,X1),f17(c37,X2)))).
% 0.19/0.49 cnf(i_0_99, negated_conjecture, (p3(f23(X1,X2),f23(X3,X4))|~p21(X1,X3)|~p22(X2,X4))).
% 0.19/0.49 cnf(i_0_101, negated_conjecture, (p24(f27(X1,X2),f27(X3,X4))|~p2(X2,X4)|~p26(X1,X3))).
% 0.19/0.49 cnf(i_0_102, negated_conjecture, (p22(f25(X1,X2),f25(X3,X4))|~p22(X2,X4)|~p24(X1,X3))).
% 0.19/0.49 cnf(i_0_103, negated_conjecture, (p21(f29(X1,X2),f29(X3,X4))|~p13(X2,X4)|~p28(X1,X3))).
% 0.19/0.49 cnf(i_0_104, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p5(X1,X3)|~p6(X2,X4))).
% 0.19/0.49 cnf(i_0_105, negated_conjecture, (p19(f20(X1,X2),f20(X3,X4))|~p13(X2,X4)|~p18(X1,X3))).
% 0.19/0.49 cnf(i_0_95, negated_conjecture, (p16(f17(X1,X2),f17(X3,X4))|~p15(X1,X3)|~p3(X2,X4))).
% 0.19/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.49 # Begin printing tableau
% 0.19/0.49 # Found 8 steps
% 0.19/0.49 cnf(i_0_99, negated_conjecture, (p3(f23(X1,X2),f23(X1,X2))|~p21(X1,X1)|~p22(X2,X2)), inference(start_rule)).
% 0.19/0.49 cnf(i_0_128, plain, (~p21(X1,X1)), inference(closure_rule, [i_0_65])).
% 0.19/0.49 cnf(i_0_129, plain, (~p22(X2,X2)), inference(closure_rule, [i_0_64])).
% 0.19/0.49 cnf(i_0_127, plain, (p3(f23(X1,X2),f23(X1,X2))), inference(extension_rule, [i_0_98])).
% 0.19/0.49 cnf(i_0_2249, plain, (~p2(X5,X5)), inference(closure_rule, [i_0_66])).
% 0.19/0.49 cnf(i_0_2248, plain, (p3(f4(X5,f23(X1,X2)),f4(X5,f23(X1,X2)))), inference(extension_rule, [i_0_96])).
% 0.19/0.49 cnf(i_0_2927, plain, (~p8(X6,X6)), inference(closure_rule, [i_0_57])).
% 0.19/0.49 cnf(i_0_2925, plain, (p9(f10(X6,f4(X5,f23(X1,X2))),f10(X6,f4(X5,f23(X1,X2))))), inference(etableau_closure_rule, [i_0_2925, ...])).
% 0.19/0.49 # End printing tableau
% 0.19/0.49 # SZS output end
% 0.19/0.49 # Branches closed with saturation will be marked with an "s"
% 0.19/0.49 # Child (26162) has found a proof.
% 0.19/0.49
% 0.19/0.49 # Proof search is over...
% 0.19/0.49 # Freeing feature tree
%------------------------------------------------------------------------------