TSTP Solution File: SYN706-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN706-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 : n020.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:27 EDT 2022
% Result : Unsatisfiable 0.18s 0.44s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN706-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 : n020.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 05:27:12 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: 81 Number of unprocessed: 81
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.18/0.37 # The folding up rule is enabled...
% 0.18/0.37 # Local unification is enabled...
% 0.18/0.37 # Any saturation attempts will use folding labels...
% 0.18/0.37 # 81 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 81 conjectures.
% 0.18/0.37 # There are 81 start rule candidates:
% 0.18/0.37 # Found 31 unit axioms.
% 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.37 # 81 start rule tableaux created.
% 0.18/0.37 # 50 extension rule candidate clauses
% 0.18/0.37 # 31 unit axiom clauses
% 0.18/0.37
% 0.18/0.37 # Requested 8, 32 cores available to the main process.
% 0.18/0.44 # There were 1 total branch saturation attempts.
% 0.18/0.44 # There were 0 of these attempts blocked.
% 0.18/0.44 # There were 0 deferred branch saturation attempts.
% 0.18/0.44 # There were 0 free duplicated saturations.
% 0.18/0.44 # There were 1 total successful branch saturations.
% 0.18/0.44 # There were 0 successful branch saturations in interreduction.
% 0.18/0.44 # There were 0 successful branch saturations on the branch.
% 0.18/0.44 # There were 1 successful branch saturations after the branch.
% 0.18/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Begin clausification derivation
% 0.18/0.44
% 0.18/0.44 # End clausification derivation
% 0.18/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.44 cnf(i_0_82, negated_conjecture, (p10(X1,X1))).
% 0.18/0.44 cnf(i_0_108, negated_conjecture, (p45(f20(c52,c50),c58))).
% 0.18/0.44 cnf(i_0_83, negated_conjecture, (p9(X1,X1))).
% 0.18/0.44 cnf(i_0_84, negated_conjecture, (p7(X1,X1))).
% 0.18/0.44 cnf(i_0_85, negated_conjecture, (p6(X1,X1))).
% 0.18/0.44 cnf(i_0_86, negated_conjecture, (p47(X1,X1))).
% 0.18/0.44 cnf(i_0_87, negated_conjecture, (p43(X1,X1))).
% 0.18/0.44 cnf(i_0_88, negated_conjecture, (p41(X1,X1))).
% 0.18/0.44 cnf(i_0_89, negated_conjecture, (p4(X1,X1))).
% 0.18/0.44 cnf(i_0_90, negated_conjecture, (p39(X1,X1))).
% 0.18/0.44 cnf(i_0_91, negated_conjecture, (p37(X1,X1))).
% 0.18/0.44 cnf(i_0_92, negated_conjecture, (p36(X1,X1))).
% 0.18/0.44 cnf(i_0_93, negated_conjecture, (p33(X1,X1))).
% 0.18/0.44 cnf(i_0_94, negated_conjecture, (p3(X1,X1))).
% 0.18/0.44 cnf(i_0_95, negated_conjecture, (p29(X1,X1))).
% 0.18/0.44 cnf(i_0_96, negated_conjecture, (p27(X1,X1))).
% 0.18/0.44 cnf(i_0_97, negated_conjecture, (p26(X1,X1))).
% 0.18/0.44 cnf(i_0_98, negated_conjecture, (p24(X1,X1))).
% 0.18/0.44 cnf(i_0_99, negated_conjecture, (p22(X1,X1))).
% 0.18/0.44 cnf(i_0_100, negated_conjecture, (p21(X1,X1))).
% 0.18/0.44 cnf(i_0_101, negated_conjecture, (p2(X1,X1))).
% 0.18/0.44 cnf(i_0_102, negated_conjecture, (p19(X1,X1))).
% 0.18/0.44 cnf(i_0_103, negated_conjecture, (p18(X1,X1))).
% 0.18/0.44 cnf(i_0_104, negated_conjecture, (p16(X1,X1))).
% 0.18/0.44 cnf(i_0_105, negated_conjecture, (p15(X1,X1))).
% 0.18/0.44 cnf(i_0_106, negated_conjecture, (p13(X1,X1))).
% 0.18/0.44 cnf(i_0_107, negated_conjecture, (p12(X1,X1))).
% 0.18/0.44 cnf(i_0_140, negated_conjecture, (p7(f8(f11(c54,f14(f17(c55,X1),f35(X2,X1))),X2),X2))).
% 0.18/0.44 cnf(i_0_141, negated_conjecture, (p4(f25(f28(c56,f31(f34(c57,X1),f32(X2,X1))),X2),X2))).
% 0.18/0.44 cnf(i_0_109, negated_conjecture, (~p4(f5(c49,c50),c51))).
% 0.18/0.44 cnf(i_0_110, negated_conjecture, (~p48(f38(f40(c59,c50),c58),c60))).
% 0.18/0.44 cnf(i_0_111, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.18/0.44 cnf(i_0_112, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.18/0.44 cnf(i_0_113, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.18/0.44 cnf(i_0_114, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.18/0.44 cnf(i_0_115, negated_conjecture, (p47(X1,X2)|~p47(X3,X2)|~p47(X3,X1))).
% 0.18/0.44 cnf(i_0_159, negated_conjecture, (p46(f23(c53,f35(X1,X2)),f5(c49,X3))|~p45(f20(c52,X3),X1))).
% 0.18/0.44 cnf(i_0_162, negated_conjecture, (p48(f38(f40(c59,c50),f8(f11(c54,f14(f17(c55,c61),X1)),X2)),c60)|~p46(f23(c53,X1),f5(c49,c50))|~p45(f20(c52,c50),X2))).
% 0.18/0.44 cnf(i_0_160, negated_conjecture, (p45(f20(c52,X1),X2)|~p46(f23(c53,f35(X2,f42(f44(c62,X2),X1))),f5(c49,X1)))).
% 0.18/0.44 cnf(i_0_116, negated_conjecture, (p43(X1,X2)|~p43(X3,X2)|~p43(X3,X1))).
% 0.18/0.44 cnf(i_0_117, negated_conjecture, (p41(X1,X2)|~p41(X3,X2)|~p41(X3,X1))).
% 0.18/0.44 cnf(i_0_118, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.18/0.44 cnf(i_0_119, negated_conjecture, (p39(X1,X2)|~p39(X3,X2)|~p39(X3,X1))).
% 0.18/0.44 cnf(i_0_120, negated_conjecture, (p37(X1,X2)|~p37(X3,X2)|~p37(X3,X1))).
% 0.18/0.44 cnf(i_0_121, negated_conjecture, (p36(X1,X2)|~p36(X3,X2)|~p36(X3,X1))).
% 0.18/0.44 cnf(i_0_122, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))).
% 0.18/0.44 cnf(i_0_123, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.18/0.44 cnf(i_0_124, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))).
% 0.18/0.44 cnf(i_0_125, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))).
% 0.18/0.44 cnf(i_0_126, negated_conjecture, (p26(X1,X2)|~p26(X3,X2)|~p26(X3,X1))).
% 0.18/0.44 cnf(i_0_127, negated_conjecture, (p24(X1,X2)|~p24(X3,X2)|~p24(X3,X1))).
% 0.18/0.44 cnf(i_0_128, negated_conjecture, (p22(X1,X2)|~p22(X3,X2)|~p22(X3,X1))).
% 0.18/0.44 cnf(i_0_129, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))).
% 0.18/0.44 cnf(i_0_130, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.18/0.44 cnf(i_0_131, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))).
% 0.18/0.44 cnf(i_0_132, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))).
% 0.18/0.44 cnf(i_0_133, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))).
% 0.18/0.44 cnf(i_0_134, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))).
% 0.18/0.44 cnf(i_0_135, negated_conjecture, (p13(X1,X2)|~p13(X3,X2)|~p13(X3,X1))).
% 0.18/0.44 cnf(i_0_136, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.18/0.44 cnf(i_0_137, negated_conjecture, (p45(X1,X2)|~p45(X3,X4)|~p19(X3,X1)|~p7(X4,X2))).
% 0.18/0.44 cnf(i_0_142, negated_conjecture, (p10(f14(X1,X2),f14(X3,X4))|~p12(X1,X3)|~p13(X2,X4))).
% 0.18/0.44 cnf(i_0_138, negated_conjecture, (p48(X1,X2)|~p48(X3,X4)|~p37(X3,X1)|~p47(X4,X2))).
% 0.18/0.44 cnf(i_0_139, negated_conjecture, (p46(X1,X2)|~p46(X3,X4)|~p22(X3,X1)|~p4(X4,X2))).
% 0.18/0.44 cnf(i_0_143, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p6(X1,X3)|~p7(X2,X4))).
% 0.18/0.44 cnf(i_0_144, negated_conjecture, (p6(f11(X1,X2),f11(X3,X4))|~p9(X1,X3)|~p10(X2,X4))).
% 0.18/0.44 cnf(i_0_145, negated_conjecture, (p41(f44(X1,X2),f44(X3,X4))|~p43(X1,X3)|~p7(X2,X4))).
% 0.18/0.44 cnf(i_0_146, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.18/0.44 cnf(i_0_147, negated_conjecture, (p4(f25(X1,X2),f25(X3,X4))|~p24(X1,X3)|~p4(X2,X4))).
% 0.18/0.44 cnf(i_0_148, negated_conjecture, (p37(f38(X1,X2),f38(X3,X4))|~p36(X1,X3)|~p7(X2,X4))).
% 0.18/0.44 cnf(i_0_149, negated_conjecture, (p36(f40(X1,X2),f40(X3,X4))|~p3(X2,X4)|~p39(X1,X3))).
% 0.18/0.44 cnf(i_0_151, negated_conjecture, (p29(f34(X1,X2),f34(X3,X4))|~p13(X2,X4)|~p33(X1,X3))).
% 0.18/0.44 cnf(i_0_152, negated_conjecture, (p27(f31(X1,X2),f31(X3,X4))|~p30(X2,X4)|~p29(X1,X3))).
% 0.18/0.44 cnf(i_0_153, negated_conjecture, (p24(f28(X1,X2),f28(X3,X4))|~p26(X1,X3)|~p27(X2,X4))).
% 0.18/0.44 cnf(i_0_154, negated_conjecture, (p22(f23(X1,X2),f23(X3,X4))|~p13(X2,X4)|~p21(X1,X3))).
% 0.18/0.44 cnf(i_0_155, negated_conjecture, (p19(f20(X1,X2),f20(X3,X4))|~p18(X1,X3)|~p3(X2,X4))).
% 0.18/0.44 cnf(i_0_156, negated_conjecture, (p16(f42(X1,X2),f42(X3,X4))|~p3(X2,X4)|~p41(X1,X3))).
% 0.18/0.44 cnf(i_0_157, negated_conjecture, (p13(f35(X1,X2),f35(X3,X4))|~p16(X2,X4)|~p7(X1,X3))).
% 0.18/0.44 cnf(i_0_158, negated_conjecture, (p12(f17(X1,X2),f17(X3,X4))|~p15(X1,X3)|~p16(X2,X4))).
% 0.18/0.44 cnf(i_0_150, negated_conjecture, (p30(f32(X1,X2),f32(X3,X4))|~p13(X2,X4)|~p4(X1,X3))).
% 0.18/0.44 cnf(i_0_161, negated_conjecture, (p45(f20(c52,X1),f8(f11(c54,f14(f17(c55,X2),X3)),X4))|~p46(f23(c53,X3),f5(c49,X1))|~p45(f20(c52,X1),X4))).
% 0.18/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.44 # Begin printing tableau
% 0.18/0.44 # Found 8 steps
% 0.18/0.44 cnf(i_0_158, negated_conjecture, (p12(f17(X17,X16),f17(X17,X16))|~p15(X17,X17)|~p16(X16,X16)), inference(start_rule)).
% 0.18/0.44 cnf(i_0_170, plain, (~p15(X17,X17)), inference(closure_rule, [i_0_105])).
% 0.18/0.44 cnf(i_0_171, plain, (~p16(X16,X16)), inference(closure_rule, [i_0_104])).
% 0.18/0.44 cnf(i_0_169, plain, (p12(f17(X17,X16),f17(X17,X16))), inference(extension_rule, [i_0_142])).
% 0.18/0.44 cnf(i_0_406, plain, (~p13(X15,X15)), inference(closure_rule, [i_0_106])).
% 0.18/0.44 cnf(i_0_404, plain, (p10(f14(f17(X17,X16),X15),f14(f17(X17,X16),X15))), inference(extension_rule, [i_0_144])).
% 0.18/0.44 cnf(i_0_453, plain, (~p9(X5,X5)), inference(closure_rule, [i_0_83])).
% 0.18/0.44 cnf(i_0_452, plain, (p6(f11(X5,f14(f17(X17,X16),X15)),f11(X5,f14(f17(X17,X16),X15)))), inference(etableau_closure_rule, [i_0_452, ...])).
% 0.18/0.44 # End printing tableau
% 0.18/0.44 # SZS output end
% 0.18/0.44 # Branches closed with saturation will be marked with an "s"
% 0.18/0.44 # Child (16948) has found a proof.
% 0.18/0.44
% 0.18/0.44 # Proof search is over...
% 0.18/0.44 # Freeing feature tree
%------------------------------------------------------------------------------