TSTP Solution File: SYO641+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYO641+1 : TPTP v8.1.0. Released v7.1.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 16:05:54 EDT 2022

% Result   : Satisfiable 0.20s 0.37s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYO641+1 : TPTP v8.1.0. Released v7.1.0.
% 0.13/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jul  9 13:28:25 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.37  # No SInE strategy applied
% 0.20/0.37  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.37  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.37  #
% 0.20/0.37  # Presaturation interreduction done
% 0.20/0.37  # Number of axioms: 3 Number of unprocessed: 3
% 0.20/0.37  # Tableaux proof search.
% 0.20/0.37  # APR header successfully linked.
% 0.20/0.37  # Hello from C++
% 0.20/0.37  # The folding up rule is enabled...
% 0.20/0.37  # Local unification is enabled...
% 0.20/0.37  # Any saturation attempts will use folding labels...
% 0.20/0.37  # 3 beginning clauses after preprocessing and clausification
% 0.20/0.37  # No conjectures after preprocessing.  Attempting to resurrect them from ax_archive.
% 0.20/0.37  # No conjectures.
% 0.20/0.37  # There are 3 start rule candidates:
% 0.20/0.37  # Found 1 unit axioms.
% 0.20/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37  # 3 start rule tableaux created.
% 0.20/0.37  # 2 extension rule candidate clauses
% 0.20/0.37  # 1 unit axiom clauses
% 0.20/0.37  
% 0.20/0.37  # Requested 8, 32 cores available to the main process.
% 0.20/0.37  # There are not enough tableaux to fork, creating more from the initial 3
% 0.20/0.37  # 14478 Satisfiable branch
% 0.20/0.37  # Satisfiable branch found.
% 0.20/0.37  # There were 1 total branch saturation attempts.
% 0.20/0.37  # There were 0 of these attempts blocked.
% 0.20/0.37  # There were 0 deferred branch saturation attempts.
% 0.20/0.37  # There were 0 free duplicated saturations.
% 0.20/0.37  # There were 0 total successful branch saturations.
% 0.20/0.37  # There were 0 successful branch saturations in interreduction.
% 0.20/0.37  # There were 0 successful branch saturations on the branch.
% 0.20/0.37  # There were 0 successful branch saturations after the branch.
% 0.20/0.37  # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.37  # Begin clausification derivation
% 0.20/0.37  
% 0.20/0.37  # End clausification derivation
% 0.20/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.37  cnf(i_0_3, plain, (f(esk1_0,esk2_0,X1))).
% 0.20/0.37  cnf(i_0_2, plain, (f(X1,esk3_1(X2),esk3_1(X2))|~f(X2,X1,esk3_1(X2)))).
% 0.20/0.37  cnf(i_0_1, plain, (~f(X1,X2,X3)|~f(X4,X1,X5)|~f(X6,X4,X7))).
% 0.20/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.37  # Begin printing tableau
% 0.20/0.37  # Found 5 steps
% 0.20/0.37  cnf(i_0_2, plain, (f(esk2_0,esk3_1(esk1_0),esk3_1(esk1_0))|~f(esk1_0,esk2_0,esk3_1(esk1_0))), inference(start_rule)).
% 0.20/0.37  cnf(i_0_6, plain, (~f(esk1_0,esk2_0,esk3_1(esk1_0))), inference(closure_rule, [i_0_3])).
% 0.20/0.37  cnf(i_0_5, plain, (f(esk2_0,esk3_1(esk1_0),esk3_1(esk1_0))), inference(extension_rule, [i_0_1])).
% 0.20/0.37  cnf(i_0_19, plain, (~f(esk1_0,esk2_0,X8)), inference(closure_rule, [i_0_3])).
% 0.20/0.37  cnf(i_0_17, plain, (~f(esk3_1(esk1_0),esk3_1(X4),esk3_1(X4))), inference(extension_rule, [i_0_2])).
% 0.20/0.37  # End printing tableau
% 0.20/0.37  # SZS output end
% 0.20/0.37  # Branches closed with saturation will be marked with an "s"
% 0.20/0.37  # Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37  # We now have 6 tableaux to operate on
% 0.20/0.37  # Found closed tableau during pool population.
% 0.20/0.37  # Proof search is over...
% 0.20/0.37  # Freeing feature tree
%------------------------------------------------------------------------------