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

View Problem - Process Solution 
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN611-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 : n016.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:12:49 EDT 2022

% Result   : Unsatisfiable 0.21s 0.40s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SYN611-1 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.15  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36  % Computer : n016.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Mon Jul 11 19:19:13 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.39  # No SInE strategy applied
% 0.14/0.39  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39  #
% 0.14/0.39  # Presaturation interreduction done
% 0.14/0.39  # Number of axioms: 30 Number of unprocessed: 30
% 0.14/0.39  # Tableaux proof search.
% 0.14/0.39  # APR header successfully linked.
% 0.14/0.39  # Hello from C++
% 0.14/0.39  # The folding up rule is enabled...
% 0.14/0.39  # Local unification is enabled...
% 0.14/0.39  # Any saturation attempts will use folding labels...
% 0.14/0.39  # 30 beginning clauses after preprocessing and clausification
% 0.14/0.39  # Creating start rules for all 30 conjectures.
% 0.14/0.39  # There are 30 start rule candidates:
% 0.14/0.39  # Found 12 unit axioms.
% 0.14/0.39  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.39  # 30 start rule tableaux created.
% 0.14/0.39  # 18 extension rule candidate clauses
% 0.14/0.39  # 12 unit axiom clauses
% 0.14/0.39  
% 0.14/0.39  # Requested 8, 32 cores available to the main process.
% 0.21/0.40  # There were 1 total branch saturation attempts.
% 0.21/0.40  # There were 0 of these attempts blocked.
% 0.21/0.40  # There were 0 deferred branch saturation attempts.
% 0.21/0.40  # There were 0 free duplicated saturations.
% 0.21/0.40  # There were 1 total successful branch saturations.
% 0.21/0.40  # There were 0 successful branch saturations in interreduction.
% 0.21/0.40  # There were 0 successful branch saturations on the branch.
% 0.21/0.40  # There were 1 successful branch saturations after the branch.
% 0.21/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.40  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.40  # Begin clausification derivation
% 0.21/0.40  
% 0.21/0.40  # End clausification derivation
% 0.21/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.40  cnf(i_0_36, negated_conjecture, (p3(f12(c22,c21),c22))).
% 0.21/0.40  cnf(i_0_38, negated_conjecture, (p3(f12(f15(c22),c21),f15(c22)))).
% 0.21/0.40  cnf(i_0_32, negated_conjecture, (p2(X1,X1))).
% 0.21/0.40  cnf(i_0_33, negated_conjecture, (p5(X1,X1))).
% 0.21/0.40  cnf(i_0_34, negated_conjecture, (p3(X1,X1))).
% 0.21/0.40  cnf(i_0_52, negated_conjecture, (p3(f12(f4(f6(f7(f8(c20)))),c21),f4(f6(f7(f8(c20))))))).
% 0.21/0.40  cnf(i_0_57, negated_conjecture, (p3(f12(f15(f4(f6(f7(f8(c20))))),c21),f15(f4(f6(f7(f8(c20)))))))).
% 0.21/0.40  cnf(i_0_59, negated_conjecture, (p17(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),f6(f7(f8(c20)))))).
% 0.21/0.40  cnf(i_0_31, negated_conjecture, (~p16(c21))).
% 0.21/0.40  cnf(i_0_35, negated_conjecture, (~p5(c21,f7(c20)))).
% 0.21/0.40  cnf(i_0_37, negated_conjecture, (~p3(c19,f4(f6(f7(c20)))))).
% 0.21/0.40  cnf(i_0_58, negated_conjecture, (~p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))))).
% 0.21/0.40  cnf(i_0_39, negated_conjecture, (p16(X1)|~p5(X2,X1)|~p16(X2))).
% 0.21/0.40  cnf(i_0_47, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.40  cnf(i_0_48, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.21/0.40  cnf(i_0_41, negated_conjecture, (p2(f6(X1),f6(X2))|~p5(X1,X2))).
% 0.21/0.40  cnf(i_0_42, negated_conjecture, (p2(f9(X1),f9(X2))|~p3(X1,X2))).
% 0.21/0.40  cnf(i_0_46, negated_conjecture, (p5(f7(X1),f7(X2))|~p5(X1,X2))).
% 0.21/0.40  cnf(i_0_49, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.21/0.40  cnf(i_0_40, negated_conjecture, (p5(f8(X1),f8(X2))|~p5(X1,X2))).
% 0.21/0.40  cnf(i_0_45, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.21/0.40  cnf(i_0_44, negated_conjecture, (p3(f15(X1),f15(X2))|~p3(X1,X2))).
% 0.21/0.40  cnf(i_0_43, negated_conjecture, (p3(f13(X1),f13(X2))|~p5(X1,X2))).
% 0.21/0.40  cnf(i_0_60, negated_conjecture, (p17(f9(f10(f4(f6(f7(f8(c20)))),f11(c19,f12(f13(X1),X1)))),f6(f7(f8(c20))))|p5(X1,f7(c20))|~p18(X1,c21))).
% 0.21/0.40  cnf(i_0_56, negated_conjecture, (p3(f12(X1,X2),f12(X3,X4))|~p3(X1,X3)|~p5(X2,X4))).
% 0.21/0.40  cnf(i_0_53, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p3(X2,X4)|~p3(X1,X3))).
% 0.21/0.40  cnf(i_0_54, negated_conjecture, (p3(f10(X1,X2),f10(X3,X4))|~p3(X2,X4)|~p3(X1,X3))).
% 0.21/0.40  cnf(i_0_50, negated_conjecture, (p17(X1,X2)|~p17(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.21/0.40  cnf(i_0_55, negated_conjecture, (p3(f11(X1,X2),f11(X3,X4))|~p3(X2,X4)|~p3(X1,X3))).
% 0.21/0.40  cnf(i_0_51, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p5(X4,X2)|~p5(X3,X1))).
% 0.21/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.40  # Begin printing tableau
% 0.21/0.40  # Found 8 steps
% 0.21/0.40  cnf(i_0_50, negated_conjecture, (p17(f9(f10(f14(f4(f9(c19)),c19),f12(X10,c21))),f6(f7(f8(c20))))|~p17(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),f6(f7(f8(c20))))|~p2(f6(f7(f8(c20))),f6(f7(f8(c20))))|~p2(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),f9(f10(f14(f4(f9(c19)),c19),f12(X10,c21))))), inference(start_rule)).
% 0.21/0.40  cnf(i_0_68, plain, (p17(f9(f10(f14(f4(f9(c19)),c19),f12(X10,c21))),f6(f7(f8(c20))))), inference(closure_rule, [i_0_58])).
% 0.21/0.40  cnf(i_0_69, plain, (~p17(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),f6(f7(f8(c20))))), inference(closure_rule, [i_0_59])).
% 0.21/0.40  cnf(i_0_70, plain, (~p2(f6(f7(f8(c20))),f6(f7(f8(c20))))), inference(closure_rule, [i_0_32])).
% 0.21/0.40  cnf(i_0_71, plain, (~p2(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),f9(f10(f14(f4(f9(c19)),c19),f12(X10,c21))))), inference(extension_rule, [i_0_42])).
% 0.21/0.40  cnf(i_0_159, plain, (~p3(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20))))),f10(f14(f4(f9(c19)),c19),f12(X10,c21)))), inference(extension_rule, [i_0_54])).
% 0.21/0.40  cnf(i_0_173, plain, (~p3(f14(f4(f9(c19)),c19),f14(f4(f9(c19)),c19))), inference(closure_rule, [i_0_34])).
% 0.21/0.40  cnf(i_0_172, plain, (~p3(f4(f6(f7(f8(c20)))),f12(X10,c21))), inference(etableau_closure_rule, [i_0_172, ...])).
% 0.21/0.40  # End printing tableau
% 0.21/0.40  # SZS output end
% 0.21/0.40  # Branches closed with saturation will be marked with an "s"
% 0.21/0.40  # Child (32160) has found a proof.
% 0.21/0.40  
% 0.21/0.40  # Proof search is over...
% 0.21/0.40  # Freeing feature tree
%------------------------------------------------------------------------------