TSTP Solution File: SYN650-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN650-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 : n017.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:04 EDT 2022

% Result   : Unsatisfiable 0.16s 0.41s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN650-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.11  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.31  % Computer : n017.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Tue Jul 12 03:03:19 EDT 2022
% 0.11/0.31  % CPUTime  : 
% 0.16/0.34  # No SInE strategy applied
% 0.16/0.34  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.16/0.34  # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.16/0.34  #
% 0.16/0.34  # Presaturation interreduction done
% 0.16/0.34  # Number of axioms: 45 Number of unprocessed: 45
% 0.16/0.34  # Tableaux proof search.
% 0.16/0.34  # APR header successfully linked.
% 0.16/0.34  # Hello from C++
% 0.16/0.34  # The folding up rule is enabled...
% 0.16/0.34  # Local unification is enabled...
% 0.16/0.34  # Any saturation attempts will use folding labels...
% 0.16/0.34  # 45 beginning clauses after preprocessing and clausification
% 0.16/0.34  # Creating start rules for all 45 conjectures.
% 0.16/0.34  # There are 45 start rule candidates:
% 0.16/0.34  # Found 14 unit axioms.
% 0.16/0.34  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.16/0.34  # 45 start rule tableaux created.
% 0.16/0.34  # 31 extension rule candidate clauses
% 0.16/0.34  # 14 unit axiom clauses
% 0.16/0.34  
% 0.16/0.34  # Requested 8, 32 cores available to the main process.
% 0.16/0.41  # There were 2 total branch saturation attempts.
% 0.16/0.41  # There were 0 of these attempts blocked.
% 0.16/0.41  # There were 0 deferred branch saturation attempts.
% 0.16/0.41  # There were 0 free duplicated saturations.
% 0.16/0.41  # There were 2 total successful branch saturations.
% 0.16/0.41  # There were 0 successful branch saturations in interreduction.
% 0.16/0.41  # There were 0 successful branch saturations on the branch.
% 0.16/0.41  # There were 2 successful branch saturations after the branch.
% 0.16/0.41  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.41  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.41  # Begin clausification derivation
% 0.16/0.41  
% 0.16/0.41  # End clausification derivation
% 0.16/0.41  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.16/0.41  cnf(i_0_53, negated_conjecture, (p22(f3(f4(f5(c26))),c27))).
% 0.16/0.41  cnf(i_0_55, negated_conjecture, (p24(c33,f20(f11(c29,f12(c27,c30)))))).
% 0.16/0.41  cnf(i_0_46, negated_conjecture, (p10(X1,X1))).
% 0.16/0.41  cnf(i_0_47, negated_conjecture, (p8(X1,X1))).
% 0.16/0.41  cnf(i_0_48, negated_conjecture, (p7(X1,X1))).
% 0.16/0.41  cnf(i_0_49, negated_conjecture, (p6(X1,X1))).
% 0.16/0.41  cnf(i_0_50, negated_conjecture, (p2(X1,X1))).
% 0.16/0.41  cnf(i_0_51, negated_conjecture, (p19(X1,X1))).
% 0.16/0.41  cnf(i_0_68, negated_conjecture, (p8(c28,f9(f11(c29,f12(c27,c30)),c31,c32)))).
% 0.16/0.41  cnf(i_0_80, negated_conjecture, (p8(f16(f17(c32,c33)),f13(f15(f11(c29,f12(c27,c30)),c32),f14(f3(f4(f5(c26)))))))).
% 0.16/0.41  cnf(i_0_83, negated_conjecture, (p8(f16(f17(c32,f9(f11(c29,f12(c27,c30)),c31,c32))),f13(f15(f11(c29,f12(c27,c30)),c32),f14(f3(f4(f5(c26)))))))).
% 0.16/0.41  cnf(i_0_52, negated_conjecture, (~p2(c27,f3(c26)))).
% 0.16/0.41  cnf(i_0_69, negated_conjecture, (~p8(c33,f9(f11(c29,f12(c27,c30)),c31,c32)))).
% 0.16/0.41  cnf(i_0_79, negated_conjecture, (~p23(f18(f11(c29,f12(c27,c30)),f9(f11(c29,f12(c27,c30)),c31,c32))))).
% 0.16/0.41  cnf(i_0_57, negated_conjecture, (p8(f16(X1),f16(X2))|~p8(X1,X2))).
% 0.16/0.41  cnf(i_0_58, negated_conjecture, (p8(f14(X1),f14(X2))|~p2(X1,X2))).
% 0.16/0.41  cnf(i_0_54, negated_conjecture, (p23(X1)|~p23(X2)|~p2(X2,X1))).
% 0.16/0.41  cnf(i_0_61, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))).
% 0.16/0.41  cnf(i_0_62, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.16/0.41  cnf(i_0_63, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))).
% 0.16/0.41  cnf(i_0_64, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.16/0.41  cnf(i_0_65, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.16/0.41  cnf(i_0_59, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))).
% 0.16/0.41  cnf(i_0_60, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.16/0.41  cnf(i_0_56, negated_conjecture, (p19(f20(X1),f20(X2))|~p6(X1,X2))).
% 0.16/0.41  cnf(i_0_66, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.16/0.41  cnf(i_0_67, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))).
% 0.16/0.41  cnf(i_0_71, negated_conjecture, (p22(X1,X2)|~p22(X3,X4)|~p2(X3,X1)|~p2(X4,X2))).
% 0.16/0.41  cnf(i_0_73, negated_conjecture, (p10(f12(X1,X2),f12(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.16/0.41  cnf(i_0_72, negated_conjecture, (p24(X1,X2)|~p24(X3,X4)|~p19(X4,X2)|~p8(X3,X1))).
% 0.16/0.41  cnf(i_0_70, negated_conjecture, (p25(X1,X2)|~p25(X3,X4)|~p8(X4,X2)|~p8(X3,X1))).
% 0.16/0.41  cnf(i_0_74, negated_conjecture, (p8(f17(X1,X2),f17(X3,X4))|~p8(X2,X4)|~p8(X1,X3))).
% 0.16/0.41  cnf(i_0_75, negated_conjecture, (p8(f15(X1,X2),f15(X3,X4))|~p6(X1,X3)|~p8(X2,X4))).
% 0.16/0.41  cnf(i_0_76, negated_conjecture, (p8(f13(X1,X2),f13(X3,X4))|~p8(X2,X4)|~p8(X1,X3))).
% 0.16/0.41  cnf(i_0_77, negated_conjecture, (p6(f11(X1,X2),f11(X3,X4))|~p2(X1,X3)|~p10(X2,X4))).
% 0.16/0.41  cnf(i_0_78, negated_conjecture, (p2(f18(X1,X2),f18(X3,X4))|~p6(X1,X3)|~p8(X2,X4))).
% 0.16/0.41  cnf(i_0_82, negated_conjecture, (p24(f9(f11(X1,f12(X2,X3)),c31,X4),f20(f11(X1,f12(X2,X3))))|~p22(f3(f4(f5(c26))),X2))).
% 0.16/0.41  cnf(i_0_81, negated_conjecture, (p8(f9(X1,X2,X3),f9(X4,X5,X6))|~p6(X1,X4)|~p7(X2,X5)|~p8(X3,X6))).
% 0.16/0.41  cnf(i_0_85, negated_conjecture, (p25(f16(f17(X1,f9(f11(X2,f12(X3,X4)),c31,X1))),f16(f17(X1,X5)))|~p24(X5,f20(f11(X2,f12(X3,X4))))|~p22(f3(f4(f5(c26))),X3))).
% 0.16/0.41  cnf(i_0_86, negated_conjecture, (p25(f16(f17(X1,f9(f11(X2,f12(X3,X4)),c31,X1))),f13(f15(f11(X2,f12(X3,X4)),X1),f14(f3(f4(f5(c26))))))|~p22(f3(f4(f5(c26))),X3))).
% 0.16/0.41  cnf(i_0_84, negated_conjecture, (p8(f21(X1,X2,X3,X4,X5),f21(X6,X7,X8,X9,X10))|~p2(X3,X8)|~p2(X2,X7)|~p2(X1,X6)|~p8(X5,X10)|~p8(X4,X9))).
% 0.16/0.41  cnf(i_0_88, negated_conjecture, (p8(X1,f9(f11(X2,f12(X3,X4)),c31,X5))|~p25(f16(f17(X5,X1)),f16(f17(X5,f21(X2,X3,X4,X5,X1))))|~p24(X1,f20(f11(X2,f12(X3,X4))))|~p23(f18(f11(X2,f12(X3,X4)),X1))|~p22(f3(f4(f5(c26))),X3))).
% 0.16/0.41  cnf(i_0_87, negated_conjecture, (p24(f21(X1,X2,X3,X4,X5),f20(f11(X1,f12(X2,X3))))|p8(X5,f9(f11(X1,f12(X2,X3)),c31,X4))|~p24(X5,f20(f11(X1,f12(X2,X3))))|~p23(f18(f11(X1,f12(X2,X3)),X5))|~p22(f3(f4(f5(c26))),X2))).
% 0.16/0.41  cnf(i_0_90, negated_conjecture, (p23(f18(f11(X1,f12(X2,X3)),f9(f11(X1,f12(X2,X3)),c31,X4)))|p8(X5,f9(f11(X1,f12(X2,X3)),c31,X4))|~p25(f16(f17(X4,X5)),f16(f17(X4,f21(X1,X2,X3,X4,X5))))|~p24(X5,f20(f11(X1,f12(X2,X3))))|~p22(f3(f4(f5(c26))),X2))).
% 0.16/0.41  cnf(i_0_89, negated_conjecture, (p24(f21(X1,X2,X3,X4,X5),f20(f11(X1,f12(X2,X3))))|p23(f18(f11(X1,f12(X2,X3)),f9(f11(X1,f12(X2,X3)),c31,X4)))|p8(X5,f9(f11(X1,f12(X2,X3)),c31,X4))|~p24(X5,f20(f11(X1,f12(X2,X3))))|~p22(f3(f4(f5(c26))),X2))).
% 0.16/0.41  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.16/0.41  # Begin printing tableau
% 0.16/0.41  # Found 14 steps
% 0.16/0.41  cnf(i_0_90, negated_conjecture, (p23(f18(f11(c29,f12(c27,c30)),f9(f11(c29,f12(c27,c30)),c31,c32)))|p8(c33,f9(f11(c29,f12(c27,c30)),c31,c32))|~p25(f16(f17(c32,c33)),f16(f17(c32,f21(c29,c27,c30,c32,c33))))|~p24(c33,f20(f11(c29,f12(c27,c30))))|~p22(f3(f4(f5(c26))),c27)), inference(start_rule)).
% 0.16/0.41  cnf(i_0_96, plain, (p23(f18(f11(c29,f12(c27,c30)),f9(f11(c29,f12(c27,c30)),c31,c32)))), inference(closure_rule, [i_0_79])).
% 0.16/0.41  cnf(i_0_97, plain, (p8(c33,f9(f11(c29,f12(c27,c30)),c31,c32))), inference(closure_rule, [i_0_69])).
% 0.16/0.41  cnf(i_0_99, plain, (~p24(c33,f20(f11(c29,f12(c27,c30))))), inference(closure_rule, [i_0_55])).
% 0.16/0.41  cnf(i_0_100, plain, (~p22(f3(f4(f5(c26))),c27)), inference(closure_rule, [i_0_53])).
% 0.16/0.41  cnf(i_0_98, plain, (~p25(f16(f17(c32,c33)),f16(f17(c32,f21(c29,c27,c30,c32,c33))))), inference(extension_rule, [i_0_70])).
% 0.16/0.41  cnf(i_0_259, plain, (~p8(f16(f17(c32,f21(c29,c27,c30,c32,c33))),f16(f17(c32,f21(c29,c27,c30,c32,c33))))), inference(closure_rule, [i_0_47])).
% 0.16/0.41  cnf(i_0_258, plain, (~p25(f16(f17(c32,f9(f11(c29,f12(c27,c30)),c31,c32))),f16(f17(c32,f21(c29,c27,c30,c32,c33))))), inference(extension_rule, [i_0_85])).
% 0.16/0.41  cnf(i_0_291, plain, (~p22(f3(f4(f5(c26))),c27)), inference(closure_rule, [i_0_53])).
% 0.16/0.41  cnf(i_0_290, plain, (~p24(f21(c29,c27,c30,c32,c33),f20(f11(c29,f12(c27,c30))))), inference(extension_rule, [i_0_72])).
% 0.16/0.41  cnf(i_0_342, plain, (~p24(c33,f20(f11(c29,f12(c27,c30))))), inference(closure_rule, [i_0_55])).
% 0.16/0.41  cnf(i_0_343, plain, (~p19(f20(f11(c29,f12(c27,c30))),f20(f11(c29,f12(c27,c30))))), inference(closure_rule, [i_0_51])).
% 0.16/0.41  cnf(i_0_260, plain, (~p8(f16(f17(c32,f9(f11(c29,f12(c27,c30)),c31,c32))),f16(f17(c32,c33)))), inference(etableau_closure_rule, [i_0_260, ...])).
% 0.16/0.41  cnf(i_0_344, plain, (~p8(c33,f21(c29,c27,c30,c32,c33))), inference(etableau_closure_rule, [i_0_344, ...])).
% 0.16/0.41  # End printing tableau
% 0.16/0.41  # SZS output end
% 0.16/0.41  # Branches closed with saturation will be marked with an "s"
% 0.16/0.42  # Child (15698) has found a proof.
% 0.16/0.42  
% 0.16/0.42  # Proof search is over...
% 0.16/0.42  # Freeing feature tree
%------------------------------------------------------------------------------