TSTP Solution File: SYN690-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN690-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 : n024.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:20 EDT 2022
% Result : Unsatisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN690-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.12/0.33 % Computer : n024.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 07:38:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 62 Number of unprocessed: 62
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # 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 # 62 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 62 conjectures.
% 0.12/0.37 # There are 62 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 # 62 start rule tableaux created.
% 0.12/0.37 # 40 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.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 1 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 0 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_81, negated_conjecture, (p34(c36,c37))).
% 0.12/0.38 cnf(i_0_63, negated_conjecture, (p11(X1,X1))).
% 0.12/0.38 cnf(i_0_64, negated_conjecture, (p9(X1,X1))).
% 0.12/0.38 cnf(i_0_65, negated_conjecture, (p8(X1,X1))).
% 0.12/0.38 cnf(i_0_66, negated_conjecture, (p6(X1,X1))).
% 0.12/0.38 cnf(i_0_67, negated_conjecture, (p4(X1,X1))).
% 0.12/0.38 cnf(i_0_68, negated_conjecture, (p33(X1,X1))).
% 0.12/0.38 cnf(i_0_69, negated_conjecture, (p31(X1,X1))).
% 0.12/0.38 cnf(i_0_70, negated_conjecture, (p3(X1,X1))).
% 0.12/0.38 cnf(i_0_71, negated_conjecture, (p29(X1,X1))).
% 0.12/0.38 cnf(i_0_72, negated_conjecture, (p27(X1,X1))).
% 0.12/0.38 cnf(i_0_73, negated_conjecture, (p25(X1,X1))).
% 0.12/0.38 cnf(i_0_74, negated_conjecture, (p23(X1,X1))).
% 0.12/0.38 cnf(i_0_75, negated_conjecture, (p21(X1,X1))).
% 0.12/0.38 cnf(i_0_76, negated_conjecture, (p2(X1,X1))).
% 0.12/0.38 cnf(i_0_77, negated_conjecture, (p19(X1,X1))).
% 0.12/0.38 cnf(i_0_78, negated_conjecture, (p17(X1,X1))).
% 0.12/0.38 cnf(i_0_79, negated_conjecture, (p15(X1,X1))).
% 0.12/0.38 cnf(i_0_80, negated_conjecture, (p13(X1,X1))).
% 0.12/0.38 cnf(i_0_84, negated_conjecture, (p4(f5(c38,X1),f5(f7(c39,c38),X1)))).
% 0.12/0.38 cnf(i_0_83, negated_conjecture, (p4(f5(c40,X1),f5(f7(c39,c40),X1)))).
% 0.12/0.38 cnf(i_0_82, negated_conjecture, (~p2(c38,c40))).
% 0.12/0.38 cnf(i_0_85, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))).
% 0.12/0.38 cnf(i_0_86, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.12/0.38 cnf(i_0_87, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))).
% 0.12/0.38 cnf(i_0_88, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.12/0.38 cnf(i_0_89, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.12/0.38 cnf(i_0_90, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))).
% 0.12/0.38 cnf(i_0_91, negated_conjecture, (p31(X1,X2)|~p31(X3,X2)|~p31(X3,X1))).
% 0.12/0.38 cnf(i_0_92, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.12/0.38 cnf(i_0_93, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))).
% 0.12/0.38 cnf(i_0_94, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))).
% 0.12/0.38 cnf(i_0_95, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))).
% 0.12/0.38 cnf(i_0_96, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))).
% 0.12/0.38 cnf(i_0_97, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))).
% 0.12/0.38 cnf(i_0_98, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.12/0.38 cnf(i_0_99, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))).
% 0.12/0.38 cnf(i_0_100, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))).
% 0.12/0.38 cnf(i_0_101, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))).
% 0.12/0.38 cnf(i_0_102, negated_conjecture, (p13(X1,X2)|~p13(X3,X2)|~p13(X3,X1))).
% 0.12/0.38 cnf(i_0_103, negated_conjecture, (p34(X1,X2)|~p34(X3,X4)|~p33(X3,X1)|~p8(X4,X2))).
% 0.12/0.38 cnf(i_0_104, negated_conjecture, (p35(X1,X2)|~p35(X3,X4)|~p3(X4,X2)|~p9(X3,X1))).
% 0.12/0.38 cnf(i_0_106, negated_conjecture, (p11(f14(X1,X2),f14(X3,X4))|~p13(X1,X3)|~p2(X2,X4))).
% 0.12/0.38 cnf(i_0_105, negated_conjecture, (p9(f10(X1,X2),f10(X3,X4))|~p3(X2,X4)|~p8(X1,X3))).
% 0.12/0.38 cnf(i_0_115, negated_conjecture, (p3(f12(X1,X2),f12(X3,X4))|~p3(X2,X4)|~p11(X1,X3))).
% 0.12/0.38 cnf(i_0_116, negated_conjecture, (p3(f18(X1,X2),f18(X3,X4))|~p17(X1,X3)|~p2(X2,X4))).
% 0.12/0.38 cnf(i_0_117, negated_conjecture, (p3(f30(X1,X2),f30(X3,X4))|~p29(X1,X3)|~p6(X2,X4))).
% 0.12/0.38 cnf(i_0_114, negated_conjecture, (p29(f32(X1,X2),f32(X3,X4))|~p31(X1,X3)|~p8(X2,X4))).
% 0.12/0.38 cnf(i_0_113, negated_conjecture, (p25(f28(X1,X2),f28(X3,X4))|~p27(X1,X3)|~p8(X2,X4))).
% 0.12/0.38 cnf(i_0_118, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.12/0.38 cnf(i_0_112, negated_conjecture, (p21(f24(X1,X2),f24(X3,X4))|~p23(X1,X3)|~p8(X2,X4))).
% 0.12/0.38 cnf(i_0_111, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p2(X2,X4)|~p6(X1,X3))).
% 0.12/0.38 cnf(i_0_110, negated_conjecture, (p2(f26(X1,X2),f26(X3,X4))|~p25(X1,X3)|~p6(X2,X4))).
% 0.12/0.38 cnf(i_0_109, negated_conjecture, (p19(f22(X1,X2),f22(X3,X4))|~p21(X1,X3)|~p6(X2,X4))).
% 0.12/0.38 cnf(i_0_108, negated_conjecture, (p17(f20(X1,X2),f20(X3,X4))|~p19(X1,X3)|~p2(X2,X4))).
% 0.12/0.38 cnf(i_0_107, negated_conjecture, (p13(f16(X1,X2),f16(X3,X4))|~p15(X1,X3)|~p2(X2,X4))).
% 0.12/0.38 cnf(i_0_119, negated_conjecture, (p35(f10(c37,f12(f14(f16(c41,X1),X2),X3)),X3)|p4(f5(f7(c39,X1),X3),f5(f7(c39,X2),X3)))).
% 0.12/0.38 cnf(i_0_120, negated_conjecture, (p4(f5(f7(c39,X1),X2),f5(f7(c39,X3),X2))|~p4(f5(X1,f12(f14(f16(c41,X1),X3),X2)),f5(X3,f12(f14(f16(c41,X1),X3),X2))))).
% 0.12/0.38 cnf(i_0_122, negated_conjecture, (p4(f5(f26(f28(c47,X1),X2),X3),f5(f7(X2,f26(f28(c47,X1),X2)),X3))|~p34(c36,X1)|~p4(f5(f7(X2,f26(f28(c47,X1),X2)),f30(f32(c46,X1),X2)),f5(f7(X2,f26(f28(c48,X1),X2)),f30(f32(c46,X1),X2))))).
% 0.12/0.38 cnf(i_0_121, negated_conjecture, (p4(f5(f26(f28(c47,X1),X2),X3),f5(f7(X2,f26(f28(c47,X1),X2)),X3))|p4(f5(f26(f28(c47,X1),X2),X4),f5(f26(f28(c48,X1),X2),X4))|~p35(f10(X1,X4),f30(f32(c46,X1),X2))|~p34(c36,X1))).
% 0.12/0.38 cnf(i_0_123, negated_conjecture, (p2(X1,X2)|p4(f5(f26(f28(c43,X3),X4),X5),f5(f26(f28(c44,X3),X4),X5))|~p35(f10(X3,X5),f30(f32(c42,X3),X4))|~p34(c36,X3)|~p4(f5(X2,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X2),f18(f20(f22(f24(c45,X3),X4),X1),X2)))|~p4(f5(X1,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X1),f18(f20(f22(f24(c45,X3),X4),X1),X2))))).
% 0.12/0.38 cnf(i_0_124, negated_conjecture, (p2(X1,X2)|~p34(c36,X3)|~p4(f5(f7(X4,f26(f28(c43,X3),X4)),f30(f32(c42,X3),X4)),f5(f7(X4,f26(f28(c44,X3),X4)),f30(f32(c42,X3),X4)))|~p4(f5(X2,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X2),f18(f20(f22(f24(c45,X3),X4),X1),X2)))|~p4(f5(X1,f18(f20(f22(f24(c45,X3),X4),X1),X2)),f5(f7(X4,X1),f18(f20(f22(f24(c45,X3),X4),X1),X2))))).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 19 steps
% 0.12/0.38 cnf(i_0_123, negated_conjecture, (p2(c38,c40)|p4(f5(f26(f28(c43,c37),c39),f12(f14(f16(c41,f26(f28(c43,c37),c39)),f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39))),f5(f26(f28(c44,c37),c39),f12(f14(f16(c41,f26(f28(c43,c37),c39)),f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39))))|~p35(f10(c37,f12(f14(f16(c41,f26(f28(c43,c37),c39)),f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39))),f30(f32(c42,c37),c39))|~p34(c36,c37)|~p4(f5(c40,f18(f20(f22(f24(c45,c37),c39),c38),c40)),f5(f7(c39,c40),f18(f20(f22(f24(c45,c37),c39),c38),c40)))|~p4(f5(c38,f18(f20(f22(f24(c45,c37),c39),c38),c40)),f5(f7(c39,c38),f18(f20(f22(f24(c45,c37),c39),c38),c40)))), inference(start_rule)).
% 0.12/0.38 cnf(i_0_130, plain, (p2(c38,c40)), inference(closure_rule, [i_0_82])).
% 0.12/0.38 cnf(i_0_133, plain, (~p34(c36,c37)), inference(closure_rule, [i_0_81])).
% 0.12/0.38 cnf(i_0_134, plain, (~p4(f5(c40,f18(f20(f22(f24(c45,c37),c39),c38),c40)),f5(f7(c39,c40),f18(f20(f22(f24(c45,c37),c39),c38),c40)))), inference(closure_rule, [i_0_83])).
% 0.12/0.38 cnf(i_0_135, plain, (~p4(f5(c38,f18(f20(f22(f24(c45,c37),c39),c38),c40)),f5(f7(c39,c38),f18(f20(f22(f24(c45,c37),c39),c38),c40)))), inference(closure_rule, [i_0_84])).
% 0.12/0.38 cnf(i_0_131, plain, (p4(f5(f26(f28(c43,c37),c39),f12(f14(f16(c41,f26(f28(c43,c37),c39)),f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39))),f5(f26(f28(c44,c37),c39),f12(f14(f16(c41,f26(f28(c43,c37),c39)),f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39))))), inference(extension_rule, [i_0_120])).
% 0.12/0.38 cnf(i_0_291, plain, (p4(f5(f7(c39,f26(f28(c43,c37),c39)),f30(f32(c42,c37),c39)),f5(f7(c39,f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39)))), inference(extension_rule, [i_0_124])).
% 0.12/0.38 cnf(i_0_293, plain, (p2(c38,c40)), inference(closure_rule, [i_0_82])).
% 0.12/0.38 cnf(i_0_294, plain, (~p34(c36,c37)), inference(closure_rule, [i_0_81])).
% 0.12/0.38 cnf(i_0_296, plain, (~p4(f5(c40,f18(f20(f22(f24(c45,c37),c39),c38),c40)),f5(f7(c39,c40),f18(f20(f22(f24(c45,c37),c39),c38),c40)))), inference(closure_rule, [i_0_83])).
% 0.12/0.38 cnf(i_0_297, plain, (~p4(f5(c38,f18(f20(f22(f24(c45,c37),c39),c38),c40)),f5(f7(c39,c38),f18(f20(f22(f24(c45,c37),c39),c38),c40)))), inference(closure_rule, [i_0_84])).
% 0.12/0.38 cnf(i_0_132, plain, (~p35(f10(c37,f12(f14(f16(c41,f26(f28(c43,c37),c39)),f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39))),f30(f32(c42,c37),c39))), inference(extension_rule, [i_0_119])).
% 0.12/0.38 cnf(i_0_312, plain, (p4(f5(f7(c39,f26(f28(c43,c37),c39)),f30(f32(c42,c37),c39)),f5(f7(c39,f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39)))), inference(extension_rule, [i_0_89])).
% 0.12/0.38 cnf(i_0_415, plain, (p4(f5(f7(c39,f26(f28(c43,c37),c39)),f30(f32(c42,c37),c39)),f5(f7(c39,f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39)))), inference(extension_rule, [i_0_124])).
% 0.12/0.38 cnf(i_0_534, plain, (p2(c38,c40)), inference(closure_rule, [i_0_82])).
% 0.12/0.38 cnf(i_0_535, plain, (~p34(c36,c37)), inference(closure_rule, [i_0_81])).
% 0.12/0.38 cnf(i_0_537, plain, (~p4(f5(c40,f18(f20(f22(f24(c45,c37),c39),c38),c40)),f5(f7(c39,c40),f18(f20(f22(f24(c45,c37),c39),c38),c40)))), inference(closure_rule, [i_0_83])).
% 0.12/0.38 cnf(i_0_538, plain, (~p4(f5(c38,f18(f20(f22(f24(c45,c37),c39),c38),c40)),f5(f7(c39,c38),f18(f20(f22(f24(c45,c37),c39),c38),c40)))), inference(closure_rule, [i_0_84])).
% 0.12/0.38 cnf(i_0_417, plain, (~p4(f5(f7(c39,f26(f28(c43,c37),c39)),f30(f32(c42,c37),c39)),f5(f7(c39,f26(f28(c43,c37),c39)),f30(f32(c42,c37),c39)))), inference(etableau_closure_rule, [i_0_417, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # Child (27769) has found a proof.
% 0.12/0.38
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------