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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LCL438-2 : TPTP v8.1.0. Released v3.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 : n006.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 : Sun Jul 17 10:22:15 EDT 2022

% Result   : Unsatisfiable 0.12s 0.34s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : LCL438-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/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 : n006.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 : Sat Jul  2 16:02:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  # No SInE strategy applied
% 0.12/0.34  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.34  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.34  #
% 0.12/0.34  # Presaturation interreduction done
% 0.12/0.34  # Number of axioms: 5 Number of unprocessed: 5
% 0.12/0.34  # Tableaux proof search.
% 0.12/0.34  # APR header successfully linked.
% 0.12/0.34  # Hello from C++
% 0.12/0.34  # The folding up rule is enabled...
% 0.12/0.34  # Local unification is enabled...
% 0.12/0.34  # Any saturation attempts will use folding labels...
% 0.12/0.34  # 5 beginning clauses after preprocessing and clausification
% 0.12/0.34  # Creating start rules for all 3 conjectures.
% 0.12/0.34  # There are 3 start rule candidates:
% 0.12/0.34  # Found 4 unit axioms.
% 0.12/0.34  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.34  # 3 start rule tableaux created.
% 0.12/0.34  # 1 extension rule candidate clauses
% 0.12/0.34  # 4 unit axiom clauses
% 0.12/0.34  
% 0.12/0.34  # Requested 8, 32 cores available to the main process.
% 0.12/0.34  # There are not enough tableaux to fork, creating more from the initial 3
% 0.12/0.34  # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.12/0.34  # There were 0 total branch saturation attempts.
% 0.12/0.34  # There were 0 of these attempts blocked.
% 0.12/0.34  # There were 0 deferred branch saturation attempts.
% 0.12/0.34  # There were 0 free duplicated saturations.
% 0.12/0.34  # There were 0 total successful branch saturations.
% 0.12/0.34  # There were 0 successful branch saturations in interreduction.
% 0.12/0.34  # There were 0 successful branch saturations on the branch.
% 0.12/0.34  # There were 0 successful branch saturations after the branch.
% 0.12/0.34  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34  # Begin clausification derivation
% 0.12/0.34  
% 0.12/0.34  # End clausification derivation
% 0.12/0.34  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.34  cnf(i_0_7, negated_conjecture, (c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)))).
% 0.12/0.34  cnf(i_0_6, negated_conjecture, (c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)))).
% 0.12/0.34  cnf(i_0_10, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)))).
% 0.12/0.34  cnf(i_0_8, negated_conjecture, (~c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)))).
% 0.12/0.34  cnf(i_0_9, plain, (c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))|~c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))|~c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)))).
% 0.12/0.34  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.12/0.34  # Begin printing tableau
% 0.12/0.34  # Found 6 steps
% 0.12/0.34  cnf(i_0_7, negated_conjecture, (c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(start_rule)).
% 0.12/0.34  cnf(i_0_13, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_9])).
% 0.12/0.34  cnf(i_0_20, plain, (c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(closure_rule, [i_0_8])).
% 0.12/0.34  cnf(i_0_21, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_9])).
% 0.12/0.34  cnf(i_0_24, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),t_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(closure_rule, [i_0_10])).
% 0.12/0.34  cnf(i_0_25, plain, (~c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))), inference(closure_rule, [i_0_6])).
% 0.12/0.34  # End printing tableau
% 0.12/0.34  # SZS output end
% 0.12/0.34  # Branches closed with saturation will be marked with an "s"
% 0.12/0.34  # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.34  # We now have 5 tableaux to operate on
% 0.12/0.34  # Found closed tableau during pool population.
% 0.12/0.34  # Proof search is over...
% 0.12/0.34  # Freeing feature tree
%------------------------------------------------------------------------------