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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN563-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:12:29 EDT 2022

% Result   : Unsatisfiable 3.01s 0.76s
% Output   : CNFRefutation 3.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SYN563-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 : 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 : Mon Jul 11 17:48:57 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  # No SInE strategy applied
% 0.12/0.35  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.35  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.35  #
% 0.12/0.35  # Presaturation interreduction done
% 0.12/0.35  # Number of axioms: 17 Number of unprocessed: 17
% 0.12/0.35  # Tableaux proof search.
% 0.12/0.35  # APR header successfully linked.
% 0.12/0.35  # 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  # 17 beginning clauses after preprocessing and clausification
% 0.12/0.36  # Creating start rules for all 17 conjectures.
% 0.12/0.36  # There are 17 start rule candidates:
% 0.12/0.36  # Found 6 unit axioms.
% 0.12/0.36  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36  # 17 start rule tableaux created.
% 0.12/0.36  # 11 extension rule candidate clauses
% 0.12/0.36  # 6 unit axiom clauses
% 0.12/0.36  
% 0.12/0.36  # Requested 8, 32 cores available to the main process.
% 3.01/0.76  # There were 1 total branch saturation attempts.
% 3.01/0.76  # There were 0 of these attempts blocked.
% 3.01/0.76  # There were 0 deferred branch saturation attempts.
% 3.01/0.76  # There were 0 free duplicated saturations.
% 3.01/0.76  # There were 1 total successful branch saturations.
% 3.01/0.76  # There were 0 successful branch saturations in interreduction.
% 3.01/0.76  # There were 0 successful branch saturations on the branch.
% 3.01/0.76  # There were 1 successful branch saturations after the branch.
% 3.01/0.76  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.01/0.76  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.01/0.76  # Begin clausification derivation
% 3.01/0.76  
% 3.01/0.76  # End clausification derivation
% 3.01/0.76  # Begin listing active clauses obtained from FOF to CNF conversion
% 3.01/0.76  cnf(i_0_21, negated_conjecture, (p2(f4(c7),f4(c8)))).
% 3.01/0.76  cnf(i_0_18, negated_conjecture, (p2(X1,X1))).
% 3.01/0.76  cnf(i_0_19, negated_conjecture, (p6(X1,X1))).
% 3.01/0.76  cnf(i_0_24, negated_conjecture, (p5(f3(f3(X1)),f3(f4(X1))))).
% 3.01/0.76  cnf(i_0_20, negated_conjecture, (~p6(f4(c7),c8))).
% 3.01/0.76  cnf(i_0_22, negated_conjecture, (~p6(f4(c7),f3(f4(c8))))).
% 3.01/0.76  cnf(i_0_26, negated_conjecture, (p6(c7,f3(X1))|~p6(c7,X1))).
% 3.01/0.76  cnf(i_0_23, negated_conjecture, (p6(X1,X2)|~p5(X1,X2))).
% 3.01/0.76  cnf(i_0_27, negated_conjecture, (p6(f4(X1),X2)|~p5(X1,X2))).
% 3.01/0.76  cnf(i_0_25, negated_conjecture, (p5(X1,X2)|~p6(f4(X1),X2))).
% 3.01/0.76  cnf(i_0_30, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 3.01/0.76  cnf(i_0_31, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X1,X3))).
% 3.01/0.76  cnf(i_0_29, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))).
% 3.01/0.76  cnf(i_0_28, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))).
% 3.01/0.76  cnf(i_0_32, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p6(X1,X3))).
% 3.01/0.76  cnf(i_0_33, negated_conjecture, (p6(X1,X2)|~p6(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 3.01/0.76  cnf(i_0_34, negated_conjecture, (p5(X1,X2)|~p5(X3,X4)|~p2(X3,X1)|~p2(X4,X2))).
% 3.01/0.76  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 3.01/0.76  # Begin printing tableau
% 3.01/0.76  # Found 9 steps
% 3.01/0.76  cnf(i_0_25, negated_conjecture, (p5(c7,f4(c7))|~p6(f4(c7),f4(c7))), inference(start_rule)).
% 3.01/0.76  cnf(i_0_57, plain, (~p6(f4(c7),f4(c7))), inference(closure_rule, [i_0_19])).
% 3.01/0.76  cnf(i_0_56, plain, (p5(c7,f4(c7))), inference(extension_rule, [i_0_34])).
% 3.01/0.76  cnf(i_0_72, plain, (~p2(c7,c7)), inference(closure_rule, [i_0_18])).
% 3.01/0.76  cnf(i_0_70, plain, (p5(c7,f3(f4(c8)))), inference(extension_rule, [i_0_27])).
% 3.01/0.76  cnf(i_0_93, plain, (p6(f4(c7),f3(f4(c8)))), inference(closure_rule, [i_0_22])).
% 3.01/0.76  cnf(i_0_73, plain, (~p2(f4(c7),f3(f4(c8)))), inference(extension_rule, [i_0_30])).
% 3.01/0.76  cnf(i_0_110, plain, (~p2(f3(f4(c8)),f3(f4(c8)))), inference(closure_rule, [i_0_18])).
% 3.01/0.76  cnf(i_0_111, plain, (~p2(f3(f4(c8)),f4(c7))), inference(etableau_closure_rule, [i_0_111, ...])).
% 3.01/0.76  # End printing tableau
% 3.01/0.76  # SZS output end
% 3.01/0.76  # Branches closed with saturation will be marked with an "s"
% 3.01/0.76  # Child (22920) has found a proof.
% 3.01/0.76  
% 3.01/0.76  # Proof search is over...
% 3.01/0.76  # Freeing feature tree
%------------------------------------------------------------------------------