TSTP Solution File: SYN688-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN688-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 : n027.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:19 EDT 2022
% Result : Unsatisfiable 0.19s 0.45s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN688-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 : n027.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 12:58:34 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: 62 Number of unprocessed: 62
% 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 # 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 28 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 # 34 extension rule candidate clauses
% 0.12/0.37 # 28 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.45 # There were 3 total branch saturation attempts.
% 0.19/0.45 # There were 0 of these attempts blocked.
% 0.19/0.45 # There were 0 deferred branch saturation attempts.
% 0.19/0.45 # There were 0 free duplicated saturations.
% 0.19/0.45 # There were 3 total successful branch saturations.
% 0.19/0.45 # There were 1 successful branch saturations in interreduction.
% 0.19/0.45 # There were 0 successful branch saturations on the branch.
% 0.19/0.45 # There were 2 successful branch saturations after the branch.
% 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Begin clausification derivation
% 0.19/0.45
% 0.19/0.45 # End clausification derivation
% 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.45 cnf(i_0_63, negated_conjecture, (p27(c34))).
% 0.19/0.45 cnf(i_0_64, negated_conjecture, (p27(c43))).
% 0.19/0.45 cnf(i_0_65, negated_conjecture, (p27(c35))).
% 0.19/0.45 cnf(i_0_74, negated_conjecture, (p22(c41,c42))).
% 0.19/0.45 cnf(i_0_67, negated_conjecture, (p10(X1,X1))).
% 0.19/0.45 cnf(i_0_68, negated_conjecture, (p9(X1,X1))).
% 0.19/0.45 cnf(i_0_69, negated_conjecture, (p3(X1,X1))).
% 0.19/0.45 cnf(i_0_80, negated_conjecture, (p28(f20(f19(c43)),f19(c34)))).
% 0.19/0.45 cnf(i_0_81, negated_conjecture, (p3(f15(f16(c43,c36)),c44))).
% 0.19/0.45 cnf(i_0_101, negated_conjecture, (p3(c30,f4(f5(f6(f6(f6(f6(f6(f7(c31))))))))))).
% 0.19/0.45 cnf(i_0_116, negated_conjecture, (p3(c32,f4(f8(f5(f6(f7(c31))),f5(f7(f6(f6(f7(c31)))))))))).
% 0.19/0.45 cnf(i_0_70, negated_conjecture, (p21(X1,X1))).
% 0.19/0.45 cnf(i_0_71, negated_conjecture, (p2(X1,X1))).
% 0.19/0.45 cnf(i_0_72, negated_conjecture, (p18(X1,X1))).
% 0.19/0.45 cnf(i_0_73, negated_conjecture, (p12(X1,X1))).
% 0.19/0.45 cnf(i_0_118, negated_conjecture, (p10(c35,f11(f13(f5(c31),f14(f5(f6(f7(f7(f6(f6(f7(f7(c31)))))))),f5(c31))))))).
% 0.19/0.45 cnf(i_0_117, negated_conjecture, (p10(c33,f11(f13(f5(c31),f14(f5(f7(f7(f7(f7(f7(f7(f7(c31)))))))),f5(c31))))))).
% 0.19/0.45 cnf(i_0_119, negated_conjecture, (p10(c39,f11(f13(f5(c31),f14(f5(f6(f7(f7(f7(f7(f7(f7(c31)))))))),f5(f6(f6(f7(f6(f6(f6(f7(c31)))))))))))))).
% 0.19/0.45 cnf(i_0_120, negated_conjecture, (p10(c40,f11(f13(f5(c31),f14(f5(f6(f6(f7(f7(f7(f7(f7(c31)))))))),f5(f6(f6(f7(f7(f6(f7(f7(f7(f6(f7(f6(f7(f6(f7(f6(f7(f6(f7(f6(f7(f6(f7(c31))))))))))))))))))))))))))))).
% 0.19/0.45 cnf(i_0_121, negated_conjecture, (p10(c37,f11(f13(f5(c31),f14(f5(f7(f6(f6(f7(f7(f7(f7(c31)))))))),f5(f6(f6(f6(f6(f6(f6(f6(f6(f6(f7(f6(f6(f7(f7(f7(f6(f7(f6(f6(f6(f7(f7(c31))))))))))))))))))))))))))))).
% 0.19/0.45 cnf(i_0_122, negated_conjecture, (p10(c38,f11(f13(f5(c31),f14(f5(f6(f7(f7(f6(f6(f7(f7(c31)))))))),f5(f6(f7(f7(f7(f6(f6(f6(f7(f6(f7(f7(f7(f7(f7(f6(f7(f7(f7(f7(f7(f7(f7(c31))))))))))))))))))))))))))))).
% 0.19/0.45 cnf(i_0_123, negated_conjecture, (p10(c36,f11(f13(f5(c31),f14(f5(f6(f6(f7(f6(f6(f6(f6(f7(c31))))))))),f5(f7(f7(f6(f7(f7(f7(f6(f6(f6(f7(f6(f7(f6(f7(f6(f7(f6(f6(f6(f7(f7(f7(c31))))))))))))))))))))))))))))).
% 0.19/0.45 cnf(i_0_124, negated_conjecture, (p10(c34,f11(f13(f5(c31),f14(f5(f6(f7(f7(f6(f6(f6(f6(f7(c31))))))))),f5(f6(f7(f6(f7(f7(f7(f6(f7(f7(f7(f6(f7(f6(f7(f7(f6(f6(f6(f7(f7(f7(f6(f7(c31)))))))))))))))))))))))))))))).
% 0.19/0.45 cnf(i_0_66, negated_conjecture, (~p23(c43))).
% 0.19/0.45 cnf(i_0_75, negated_conjecture, (~p24(c43,c46))).
% 0.19/0.45 cnf(i_0_76, negated_conjecture, (~p24(c43,c45))).
% 0.19/0.45 cnf(i_0_77, negated_conjecture, (~p26(f17(c43),c35))).
% 0.19/0.45 cnf(i_0_78, negated_conjecture, (~p25(f17(c43),c34))).
% 0.19/0.45 cnf(i_0_79, negated_conjecture, (p27(f17(X1))|~p27(X1))).
% 0.19/0.45 cnf(i_0_83, negated_conjecture, (p27(X1)|~p10(X2,X1)|~p27(X2))).
% 0.19/0.45 cnf(i_0_86, negated_conjecture, (p10(f17(X1),f17(X2))|~p10(X1,X2))).
% 0.19/0.45 cnf(i_0_93, negated_conjecture, (p18(f19(f17(X1)),f20(f19(X1)))|~p27(X1))).
% 0.19/0.45 cnf(i_0_82, negated_conjecture, (p23(X1)|~p10(X2,X1)|~p23(X2))).
% 0.19/0.45 cnf(i_0_85, negated_conjecture, (p10(f11(X1),f11(X2))|~p9(X1,X2))).
% 0.19/0.45 cnf(i_0_94, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.19/0.45 cnf(i_0_95, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.19/0.45 cnf(i_0_96, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.19/0.45 cnf(i_0_97, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))).
% 0.19/0.45 cnf(i_0_92, negated_conjecture, (p3(f15(X1),f15(X2))|~p10(X1,X2))).
% 0.19/0.45 cnf(i_0_84, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.19/0.45 cnf(i_0_89, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))).
% 0.19/0.45 cnf(i_0_90, negated_conjecture, (p2(f6(X1),f6(X2))|~p2(X1,X2))).
% 0.19/0.45 cnf(i_0_91, negated_conjecture, (p2(f7(X1),f7(X2))|~p2(X1,X2))).
% 0.19/0.45 cnf(i_0_87, negated_conjecture, (p18(f19(X1),f19(X2))|~p10(X1,X2))).
% 0.19/0.45 cnf(i_0_88, negated_conjecture, (p18(f20(X1),f20(X2))|~p18(X1,X2))).
% 0.19/0.45 cnf(i_0_98, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.19/0.45 cnf(i_0_99, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))).
% 0.19/0.45 cnf(i_0_100, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.19/0.45 cnf(i_0_103, negated_conjecture, (p26(X1,X2)|~p29(f19(X1),f19(X2))|~p27(X2)|~p27(X1))).
% 0.19/0.45 cnf(i_0_111, negated_conjecture, (p28(f19(X1),f19(X2))|~p25(X1,X2)|~p27(X2)|~p27(X1))).
% 0.19/0.45 cnf(i_0_102, negated_conjecture, (p25(X1,X2)|~p28(f19(X1),f19(X2))|~p27(X2)|~p27(X1))).
% 0.19/0.45 cnf(i_0_110, negated_conjecture, (p29(f19(X1),f19(X2))|~p26(X1,X2)|~p27(X2)|~p27(X1))).
% 0.19/0.45 cnf(i_0_113, negated_conjecture, (p10(f16(X1,X2),f16(X3,X4))|~p10(X2,X4)|~p10(X1,X3))).
% 0.19/0.45 cnf(i_0_104, negated_conjecture, (p22(X1,X2)|~p22(X3,X4)|~p21(X3,X1)|~p21(X4,X2))).
% 0.19/0.45 cnf(i_0_109, negated_conjecture, (p24(X1,X2)|~p24(X3,X4)|~p10(X3,X1)|~p10(X4,X2))).
% 0.19/0.45 cnf(i_0_107, negated_conjecture, (p26(X1,X2)|~p26(X3,X4)|~p10(X3,X1)|~p10(X4,X2))).
% 0.19/0.45 cnf(i_0_108, negated_conjecture, (p25(X1,X2)|~p25(X3,X4)|~p10(X3,X1)|~p10(X4,X2))).
% 0.19/0.45 cnf(i_0_112, negated_conjecture, (p9(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p2(X1,X3))).
% 0.19/0.45 cnf(i_0_115, negated_conjecture, (p2(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.19/0.45 cnf(i_0_114, negated_conjecture, (p12(f14(X1,X2),f14(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.19/0.45 cnf(i_0_106, negated_conjecture, (p28(X1,X2)|~p28(X3,X4)|~p18(X3,X1)|~p18(X4,X2))).
% 0.19/0.45 cnf(i_0_105, negated_conjecture, (p29(X1,X2)|~p29(X3,X4)|~p18(X3,X1)|~p18(X4,X2))).
% 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.45 # Begin printing tableau
% 0.19/0.45 # Found 14 steps
% 0.19/0.45 cnf(i_0_106, negated_conjecture, (p28(f20(f19(c43)),f19(c34))|~p28(f20(f19(c43)),f19(c34))|~p18(f20(f19(c43)),f20(f19(c43)))|~p18(f19(c34),f19(c34))), inference(start_rule)).
% 0.19/0.45 cnf(i_0_130, plain, (~p28(f20(f19(c43)),f19(c34))), inference(closure_rule, [i_0_80])).
% 0.19/0.45 cnf(i_0_131, plain, (~p18(f20(f19(c43)),f20(f19(c43)))), inference(closure_rule, [i_0_72])).
% 0.19/0.45 cnf(i_0_132, plain, (~p18(f19(c34),f19(c34))), inference(closure_rule, [i_0_72])).
% 0.19/0.45 cnf(i_0_129, plain, (p28(f20(f19(c43)),f19(c34))), inference(extension_rule, [i_0_106])).
% 0.19/0.45 cnf(i_0_260, plain, (~p18(f20(f19(c43)),f20(f19(c43)))), inference(closure_rule, [i_0_72])).
% 0.19/0.45 cnf(i_0_258, plain, (p28(f20(f19(c43)),f19(c34))), inference(extension_rule, [i_0_106])).
% 0.19/0.45 cnf(i_0_362, plain, (~p18(f19(c34),f19(c34))), inference(closure_rule, [i_0_72])).
% 0.19/0.45 cnf(i_0_359, plain, (p28(f19(f17(c43)),f19(c34))), inference(extension_rule, [i_0_102])).
% 0.19/0.45 cnf(i_0_399, plain, (p25(f17(c43),c34)), inference(closure_rule, [i_0_78])).
% 0.19/0.45 cnf(i_0_401, plain, (~p27(c34)), inference(closure_rule, [i_0_63])).
% 0.19/0.45 cnf(i_0_261, plain, (~p18(f19(c34),f19(c34))), inference(etableau_closure_rule, [i_0_261, ...])).
% 0.19/0.45 cnf(i_0_361, plain, (~p18(f20(f19(c43)),f19(f17(c43)))), inference(etableau_closure_rule, [i_0_361, ...])).
% 0.19/0.45 cnf(i_0_402, plain, (~p27(f17(c43))), inference(etableau_closure_rule, [i_0_402, ...])).
% 0.19/0.45 # End printing tableau
% 0.19/0.45 # SZS output end
% 0.19/0.45 # Branches closed with saturation will be marked with an "s"
% 0.19/0.45 # Child (10673) has found a proof.
% 0.19/0.45
% 0.19/0.45 # Proof search is over...
% 0.19/0.45 # Freeing feature tree
%------------------------------------------------------------------------------