TSTP Solution File: SYN656-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN656-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 : n011.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:07 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.11 % Problem : SYN656-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 : n011.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 14:07:12 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: 49 Number of unprocessed: 48
% 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.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 48 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 48 conjectures.
% 0.12/0.36 # There are 48 start rule candidates:
% 0.12/0.36 # Found 18 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 48 start rule tableaux created.
% 0.12/0.36 # 30 extension rule candidate clauses
% 0.12/0.36 # 18 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 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_63, negated_conjecture, (p24(c26,c27))).
% 0.12/0.38 cnf(i_0_64, negated_conjecture, (p24(f10(c30,f13(c31,X1)),c27))).
% 0.12/0.38 cnf(i_0_50, negated_conjecture, (p11(X1,X1))).
% 0.12/0.38 cnf(i_0_51, negated_conjecture, (p9(X1,X1))).
% 0.12/0.38 cnf(i_0_52, negated_conjecture, (p8(X1,X1))).
% 0.12/0.38 cnf(i_0_53, negated_conjecture, (p6(X1,X1))).
% 0.12/0.38 cnf(i_0_54, negated_conjecture, (p4(X1,X1))).
% 0.12/0.38 cnf(i_0_55, negated_conjecture, (p3(X1,X1))).
% 0.12/0.38 cnf(i_0_56, negated_conjecture, (p22(X1,X1))).
% 0.12/0.38 cnf(i_0_57, negated_conjecture, (p20(X1,X1))).
% 0.12/0.38 cnf(i_0_58, negated_conjecture, (p2(X1,X1))).
% 0.12/0.38 cnf(i_0_59, negated_conjecture, (p18(X1,X1))).
% 0.12/0.38 cnf(i_0_60, negated_conjecture, (p16(X1,X1))).
% 0.12/0.38 cnf(i_0_61, negated_conjecture, (p14(X1,X1))).
% 0.12/0.38 cnf(i_0_62, negated_conjecture, (p12(X1,X1))).
% 0.12/0.38 cnf(i_0_80, negated_conjecture, (p25(f5(c29,f13(c31,f15(c32,X1))),f13(c31,X1)))).
% 0.12/0.38 cnf(i_0_94, negated_conjecture, (~p25(f5(f7(c28,c29),f13(c31,f15(c32,f15(f17(c33,c34),c35)))),f13(c31,c34)))).
% 0.12/0.38 cnf(i_0_65, negated_conjecture, (~p25(f5(f7(c28,c29),X1),X1))).
% 0.12/0.38 cnf(i_0_66, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))).
% 0.12/0.38 cnf(i_0_67, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.12/0.38 cnf(i_0_68, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))).
% 0.12/0.38 cnf(i_0_69, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.12/0.38 cnf(i_0_79, negated_conjecture, (p24(f10(c30,X1),c27)|~p25(f5(c29,X2),X1))).
% 0.12/0.38 cnf(i_0_98, negated_conjecture, (p25(f5(f7(c28,c29),f13(c31,f15(f17(c33,c34),X1))),f13(c31,c34))|p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),X1))))).
% 0.12/0.38 cnf(i_0_81, negated_conjecture, (p25(f5(f7(c28,X1),X2),X3)|~p25(f5(X1,X2),X3))).
% 0.12/0.38 cnf(i_0_70, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.12/0.38 cnf(i_0_71, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.12/0.38 cnf(i_0_72, negated_conjecture, (p22(X1,X2)|~p22(X3,X2)|~p22(X3,X1))).
% 0.12/0.38 cnf(i_0_73, negated_conjecture, (p20(X1,X2)|~p20(X3,X2)|~p20(X3,X1))).
% 0.12/0.38 cnf(i_0_74, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.12/0.38 cnf(i_0_75, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))).
% 0.12/0.38 cnf(i_0_76, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))).
% 0.12/0.38 cnf(i_0_77, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.12/0.38 cnf(i_0_78, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.12/0.38 cnf(i_0_85, negated_conjecture, (p9(f10(X1,X2),f10(X3,X4))|~p3(X2,X4)|~p8(X1,X3))).
% 0.12/0.38 cnf(i_0_93, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.12/0.38 cnf(i_0_91, negated_conjecture, (p3(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p11(X1,X3))).
% 0.12/0.38 cnf(i_0_83, negated_conjecture, (p24(X1,X2)|~p24(X3,X4)|~p4(X4,X2)|~p9(X3,X1))).
% 0.12/0.38 cnf(i_0_92, negated_conjecture, (p3(f19(X1,X2),f19(X3,X4))|~p18(X1,X3)|~p3(X2,X4))).
% 0.12/0.38 cnf(i_0_84, negated_conjecture, (p25(X1,X2)|~p25(X3,X4)|~p3(X4,X2)|~p4(X3,X1))).
% 0.12/0.38 cnf(i_0_90, negated_conjecture, (p20(f23(X1,X2),f23(X3,X4))|~p2(X2,X4)|~p22(X1,X3))).
% 0.12/0.38 cnf(i_0_89, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p2(X2,X4)|~p6(X1,X3))).
% 0.12/0.38 cnf(i_0_88, negated_conjecture, (p18(f21(X1,X2),f21(X3,X4))|~p20(X1,X3)|~p3(X2,X4))).
% 0.12/0.38 cnf(i_0_87, negated_conjecture, (p14(f17(X1,X2),f17(X3,X4))|~p12(X2,X4)|~p16(X1,X3))).
% 0.12/0.38 cnf(i_0_86, negated_conjecture, (p12(f15(X1,X2),f15(X3,X4))|~p12(X2,X4)|~p14(X1,X3))).
% 0.12/0.38 cnf(i_0_95, negated_conjecture, (p25(f5(f7(c28,X1),X2),X3)|~p25(f5(f7(c28,X1),X4),X3)|~p25(f5(X1,X2),X4))).
% 0.12/0.38 cnf(i_0_96, negated_conjecture, (p25(f5(X1,X2),f19(f21(f23(c36,X1),X2),X3))|p25(f5(X1,X2),X3)|~p25(f5(f7(c28,X1),X2),X3))).
% 0.12/0.38 cnf(i_0_97, negated_conjecture, (p25(f5(f7(c28,X1),f19(f21(f23(c36,X1),X2),X3)),X3)|p25(f5(X1,X2),X3)|~p25(f5(f7(c28,X1),X2),X3))).
% 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 8 steps
% 0.12/0.38 cnf(i_0_88, negated_conjecture, (p18(f21(X17,X16),f21(X17,X16))|~p20(X17,X17)|~p3(X16,X16)), inference(start_rule)).
% 0.12/0.38 cnf(i_0_115, plain, (~p20(X17,X17)), inference(closure_rule, [i_0_57]))# 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 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 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_63, negated_conjecture, (p24(c26,c27))).
% 0.12/0.38 cnf(i_0_64, negated_conjecture, (p24(f10(c30,f13(c31,X1)),c27))).
% 0.12/0.38 cnf(i_0_50, negated_conjecture, (p11(X1,X1))).
% 0.12/0.38 cnf(i_0_51, negated_conjecture, (p9(X1,X1))).
% 0.12/0.38 cnf(i_0_52, negated_conjecture, (p8(X1,X1))).
% 0.12/0.38 cnf(i_0_53, negated_conjecture, (p6(X1,X1))).
% 0.12/0.38 cnf(i_0_54, negated_conjecture, (p4(X1,X1))).
% 0.12/0.38 cnf(i_0_55, negated_conjecture, (p3(X1,X1))).
% 0.12/0.38 cnf(i_0_56, negated_conjecture, (p22(X1,X1))).
% 0.12/0.38 cnf(i_0_57, negated_conjecture, (p20(X1,X1))).
% 0.12/0.38 cnf(i_0_58, negated_conjecture, (p2(X1,X1))).
% 0.12/0.38 cnf(i_0_59, negated_conjecture, (p18(X1,X1))).
% 0.12/0.38 cnf(i_0_60, negated_conjecture, (p16(X1,X1))).
% 0.12/0.38 cnf(i_0_61, negated_conjecture, (p14(X1,X1))).
% 0.12/0.38 cnf(i_0_62, negated_conjecture, (p12(X1,X1))).
% 0.12/0.38 cnf(i_0_80, negated_conjecture, (p25(f5(c29,f13(c31,f15(c32,X1))),f13(c31,X1)))).
% 0.12/0.38 cnf(i_0_94, negated_conjecture, (~p25(f5(f7(c28,c29),f13(c31,f15(c32,f15(f17(c33,c34),c35)))),f13(c31,c34)))).
% 0.12/0.38 cnf(i_0_65, negated_conjecture, (~p25(f5(f7(c28,c29),X1),X1))).
% 0.12/0.38 cnf(i_0_66, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))).
% 0.12/0.38 cnf(i_0_67, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.12/0.38 cnf(i_0_68, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))).
% 0.12/0.38 cnf(i_0_69, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.12/0.38 cnf(i_0_79, negated_conjecture, (p24(f10(c30,X1),c27)|~p25(f5(c29,X2),X1))).
% 0.12/0.38 cnf(i_0_98, negated_conjecture, (p25(f5(f7(c28,c29),f13(c31,f15(f17(c33,c34),X1))),f13(c31,c34))|p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),X1))))).
% 0.12/0.38 cnf(i_0_81, negated_conjecture, (p25(f5(f7(c28,X1),X2),X3)|~p25(f5(X1,X2),X3))).
% 0.12/0.38 cnf(i_0_70, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.12/0.38 cnf(i_0_71, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.12/0.38 cnf(i_0_72, negated_conjecture, (p22(X1,X2)|~p22(X3,X2)|~p22(X3,X1))).
% 0.12/0.38 cnf(i_0_73, negated_conjecture, (p20(X1,X2)|~p20(X3,X2)|~p20(X3,X1))).
% 0.12/0.38 cnf(i_0_74, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.12/0.38 cnf(i_0_75, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))).
% 0.12/0.38 cnf(i_0_76, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))).
% 0.12/0.38 cnf(i_0_77, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.12/0.38 cnf(i_0_78, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.12/0.38 cnf(i_0_85, negated_conjecture, (p9(f10(X1,X2),f10(X3,X4))|~p3(X2,X4)|~p8(X1,X3))).
% 0.12/0.38 cnf(i_0_93, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.12/0.38 cnf(i_0_91, negated_conjecture, (p3(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p11(X1,X3))).
% 0.12/0.38 cnf(i_0_83, negated_conjecture, (p24(X1,X2)|~p24(X3,X4)|~p4(X4,X2)|~p9(X3,X1))).
% 0.12/0.38 cnf(i_0_92, negated_conjecture, (p3(f19(X1,X2),f19(X3,X4))|~p18(X1,X3)|~p3(X2,X4))).
% 0.12/0.38 cnf(i_0_84, negated_conjecture, (p25(X1,X2)|~p25(X3,X4)|~p3(X4,X2)|~p4(X3,X1))).
% 0.12/0.38 cnf(i_0_90, negated_conjecture, (p20(f23(X1,X2),f23(X3,X4))|~p2(X2,X4)|~p22(X1,X3))).
% 0.12/0.38 cnf(i_0_89, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p2(X2,X4)|~p6(X1,X3))).
% 0.12/0.38 cnf(i_0_88, negated_conjecture, (p18(f21(X1,X2),f21(X3,X4))|~p20(X1,X3)|~p3(X2,X4))).
% 0.12/0.38 cnf(i_0_87, negated_conjecture, (p14(f17(X1,X2),f17(X3,X4))|~p12(X2,X4)|~p16(X1,X3))).
% 0.12/0.38 cnf(i_0_86, negated_conjecture, (p12(f15(X1,X2),f15(X3,X4))|~p12(X2,X4)|~p14(X1,X3))).
% 0.12/0.38 cnf(i_0_95, negated_conjecture, (p25(f5(f7(c28,X1),X2),X3)|~p25(f5(f7(c28,X1),X4),X3)|~p25(f5(X1,X2),X4))).
% 0.12/0.38 cnf(i_0_96, negated_conjecture, (p25(f5(X1,X2),f19(f21(f23(c36,X1),X2),X3))|p25(f5(X1,X2),X3)|~p25(f5(f7(c28,X1),X2),X3))).
% 0.12/0.38 cnf(i_0_97, negated_conjecture, (p25(f5(f7(c28,X1),f19(f21(f23(c36,X1),X2),X3)),X3)|p25(f5(X1,X2),X3)|~p25(f5(f7(c28,X1),X2),X3))).
% 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 8 steps
% 0.12/0.38 cnf(i_0_89, negated_conjecture, (p2(f7(X12,X13),f7(X12,X13))|~p2(X13,X13)|~p6(X12,X12)), inference(start_rule)).
% 0.12/0.38 cnf(i_0_118, plain, (~p2(X13,X13)), inference(closure_rule, [i_0_58])).
% 0.12/0.38 cnf(i_0_119, plain, (~p6(X12,X12)), inference(closure_rule, [i_0_53])).
% 0.12/0.38 cnf(i_0_117, plain, (p2(f7(X12,X13),f7(X12,X13))), inference(extension_rule, [i_0_89])).
% 0.12/0.38 cnf(i_0_226, plain, (~p6(X14,X14)), inference(closure_rule, [i_0_53])).
% 0.12/0.38 cnf(i_0_224, plain, (p2(f7(X14,f7(X12,X13)),f7(X14,f7(X12,X13)))), inference(extension_rule, [i_0_90])).
% 0.12/0.38 cnf(i_0_247, plain, (~p22(X6,X6)), inference(closure_rule, [i_0_56])).
% 0.12/0.38 cnf(i_0_245, plain, (p20(f23(X6,f7(X14,f7(X12,X13))),f23(X6,f7(X14,f7(X12,X13))))), inference(etableau_closure_rule, [i_0_245, ...])).
% 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 .
% 0.12/0.38 cnf(i_0_116, plain, (~p3(X16,X16)), inference(closure_rule, [i_0_55])).
% 0.12/0.38 cnf(i_0_114, plain, (p18(f21(X17,X16),f21(X17,X16))), inference(extension_rule, [i_0_92])).
% 0.12/0.38 cnf(i_0_236, plain, (~p3(X15,X15)), inference(closure_rule, [i_0_55])).
% 0.12/0.38 cnf(i_0_234, plain, (p3(f19(f21(X17,X16),X15),f19(f21(X17,X16),X15))), inference(extension_rule, [i_0_88])).
% 0.12/0.38 cnf(i_0_253, plain, (~p20(X5,X5)), inference(closure_rule, [i_0_57])).
% 0.12/0.38 cnf(i_0_252, plain, (p18(f21(X5,f19(f21(X17,X16),X15)),f21(X5,f19(f21(X17,X16),X15)))), inference(etableau_closure_rule, [i_0_252, ...])).
% 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 (18075) has found a proof.
% 0.12/0.38
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------