TSTP Solution File: SYN084-2 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN084-2 : TPTP v8.1.0. Released v1.2.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 : n026.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:08:04 EDT 2022

% Result   : Unsatisfiable 0.10s 0.35s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYN084-2 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.11  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.32  % Computer : n026.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 600
% 0.10/0.32  % DateTime : Tue Jul 12 01:27:12 EDT 2022
% 0.10/0.32  % CPUTime  : 
% 0.10/0.35  # No SInE strategy applied
% 0.10/0.35  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.35  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.10/0.35  #
% 0.10/0.35  # Presaturation interreduction done
% 0.10/0.35  # Number of axioms: 7 Number of unprocessed: 7
% 0.10/0.35  # Tableaux proof search.
% 0.10/0.35  # APR header successfully linked.
% 0.10/0.35  # Hello from C++
% 0.10/0.35  # The folding up rule is enabled...
% 0.10/0.35  # Local unification is enabled...
% 0.10/0.35  # Any saturation attempts will use folding labels...
% 0.10/0.35  # 7 beginning clauses after preprocessing and clausification
% 0.10/0.35  # Creating start rules for all 7 conjectures.
% 0.10/0.35  # There are 7 start rule candidates:
% 0.10/0.35  # Found 1 unit axioms.
% 0.10/0.35  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.10/0.35  # 7 start rule tableaux created.
% 0.10/0.35  # 6 extension rule candidate clauses
% 0.10/0.35  # 1 unit axiom clauses
% 0.10/0.35  
% 0.10/0.35  # Requested 8, 32 cores available to the main process.
% 0.10/0.35  # There are not enough tableaux to fork, creating more from the initial 7
% 0.10/0.35  # Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
% 0.10/0.35  # We now have 18 tableaux to operate on
% 0.10/0.35  # There were 2 total branch saturation attempts.
% 0.10/0.35  # There were 0 of these attempts blocked.
% 0.10/0.35  # There were 0 deferred branch saturation attempts.
% 0.10/0.35  # There were 0 free duplicated saturations.
% 0.10/0.35  # There were 2 total successful branch saturations.
% 0.10/0.35  # There were 0 successful branch saturations in interreduction.
% 0.10/0.35  # There were 0 successful branch saturations on the branch.
% 0.10/0.35  # There were 2 successful branch saturations after the branch.
% 0.10/0.35  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35  # Begin clausification derivation
% 0.10/0.35  
% 0.10/0.35  # End clausification derivation
% 0.10/0.35  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.10/0.35  cnf(i_0_8, negated_conjecture, (big_p(a))).
% 0.10/0.35  cnf(i_0_11, negated_conjecture, (~big_p(f(f(sk1)))|~big_p(f(f(sk2))))).
% 0.10/0.35  cnf(i_0_13, negated_conjecture, (big_p(f(sk1))|~big_p(f(f(sk2)))|~big_p(sk1))).
% 0.10/0.35  cnf(i_0_14, negated_conjecture, (big_p(f(sk2))|~big_p(f(f(sk1)))|~big_p(sk2))).
% 0.10/0.35  cnf(i_0_12, negated_conjecture, (big_p(f(sk2))|big_p(f(sk1))|~big_p(sk1)|~big_p(sk2))).
% 0.10/0.35  cnf(i_0_9, negated_conjecture, (big_p(f(f(X1)))|big_p(X1))).
% 0.10/0.35  cnf(i_0_10, negated_conjecture, (big_p(f(f(X1)))|~big_p(f(X1)))).
% 0.10/0.35  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.10/0.35  # Begin printing tableau
% 0.10/0.35  # Found 5 steps
% 0.10/0.35  cnf(i_0_10, negated_conjecture, (big_p(f(f(sk2)))|~big_p(f(sk2))), inference(start_rule)).
% 0.10/0.35  cnf(i_0_15, plain, (big_p(f(f(sk2)))), inference(extension_rule, [i_0_11])).
% 0.10/0.35  cnf(i_0_46, plain, (~big_p(f(f(sk1)))), inference(extension_rule, [i_0_10])).
% 0.10/0.35  cnf(i_0_16, plain, (~big_p(f(sk2))), inference(etableau_closure_rule, [i_0_16, ...])).
% 0.10/0.35  cnf(i_0_81, plain, (~big_p(f(sk1))), inference(etableau_closure_rule, [i_0_81, ...])).
% 0.10/0.35  # End printing tableau
% 0.10/0.35  # SZS output end
% 0.10/0.35  # Branches closed with saturation will be marked with an "s"
% 0.10/0.35  # Child (27066) has found a proof.
% 0.10/0.35  
% 0.10/0.35  # Proof search is over...
% 0.10/0.35  # Freeing feature tree
%------------------------------------------------------------------------------