↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LAT262-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:04:35 PM UTC 2026

% Result   : Unsatisfiable 0.26s 0.53s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    8 (   8 unt;   0 nHn;   6 RR)
%            Number of literals    :    8 (   2 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
    ~ c_lessequals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0,axiom,
    c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_0_3,negated_conjecture,
    ~ c_lessequals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).

cnf(c_0_4,negated_conjecture,
    ~ c_lessequals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)),
    c_0_3 ).

cnf(c_0_5,axiom,
    c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),
    cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0 ).

cnf(c_0_6,negated_conjecture,
    c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),
    cls_conjecture_0 ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LAT262-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43  % Computer : n016.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Sun Sep 20 23:28:22 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.51  Running first-order theorem proving
% 0.26/0.51  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.26/0.53  % Version: 3.5.1
% 0.26/0.53  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.53  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.53  % Starting sh5l with 300s (1) cores
% 0.26/0.53  % new_bool_3 with pid 1017205 completed with status 0
% 0.26/0.53  % Result found by new_bool_3
% 0.26/0.53  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.53  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.53  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.53  % Search class: FUUSF-FFSF32-SFFFFFNN
% 0.26/0.53  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.53  % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.53  % SubtermCWHack with pid 1017211 completed with status 0
% 0.26/0.53  % Result found by SubtermCWHack
% 0.26/0.53  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.53  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.53  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.53  % Search class: FUUSF-FFSF32-SFFFFFNN
% 0.26/0.53  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.53  % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.53  % Preprocessing time       : 0.001 s
% 0.26/0.53  
% 0.26/0.53  % Proof found!
% 0.26/0.53  % SZS status Unsatisfiable
% 0.26/0.53  % SZS output start CNFRefutation
% See solution above
% 0.26/0.53  % Parsed axioms                        : 4
% 0.26/0.53  % Removed by relevancy pruning/SinE    : 1
% 0.26/0.53  % Initial clauses                      : 3
% 0.26/0.53  % Removed in clause preprocessing      : 0
% 0.26/0.53  % Initial clauses in saturation        : 3
% 0.26/0.53  % Processed clauses                    : 3
% 0.26/0.53  % ...of these trivial                  : 0
% 0.26/0.53  % ...subsumed                          : 0
% 0.26/0.53  % ...remaining for further processing  : 3
% 0.26/0.53  % Other redundant clauses eliminated   : 0
% 0.26/0.53  % Clauses deleted for lack of memory   : 0
% 0.26/0.53  % Backward-subsumed                    : 0
% 0.26/0.53  % Backward-rewritten                   : 1
% 0.26/0.53  % Generated clauses                    : 0
% 0.26/0.53  % ...of the previous two non-redundant : 0
% 0.26/0.53  % ...aggressively subsumed             : 0
% 0.26/0.53  % Contextual simplify-reflections      : 0
% 0.26/0.53  % Paramodulations                      : 0
% 0.26/0.53  % Factorizations                       : 0
% 0.26/0.53  % NegExts                              : 0
% 0.26/0.53  % Equation resolutions                 : 0
% 0.26/0.53  % Disequality decompositions           : 0
% 0.26/0.53  % Total rewrite steps                  : 2
% 0.26/0.53  % ...of those cached                   : 0
% 0.26/0.53  % Propositional unsat checks           : 0
% 0.26/0.53  %    Propositional check models        : 0
% 0.26/0.53  %    Propositional check unsatisfiable : 0
% 0.26/0.53  %    Propositional clauses             : 0
% 0.26/0.53  %    Propositional clauses after purity: 0
% 0.26/0.53  %    Propositional unsat core size     : 0
% 0.26/0.53  %    Propositional preprocessing time  : 0.000
% 0.26/0.53  %    Propositional encoding time       : 0.000
% 0.26/0.53  %    Propositional solver time         : 0.000
% 0.26/0.53  %    Success case prop preproc time    : 0.000
% 0.26/0.53  %    Success case prop encoding time   : 0.000
% 0.26/0.53  %    Success case prop solver time     : 0.000
% 0.26/0.53  % Current number of processed clauses  : 2
% 0.26/0.53  %    Positive orientable unit clauses  : 2
% 0.26/0.53  %    Positive unorientable unit clauses: 0
% 0.26/0.53  %    Negative unit clauses             : 0
% 0.26/0.53  %    Non-unit-clauses                  : 0
% 0.26/0.53  % Current number of unprocessed clauses: 0
% 0.26/0.53  % ...number of literals in the above   : 0
% 0.26/0.53  % Current number of archived formulas  : 0
% 0.26/0.53  % Current number of archived clauses   : 1
% 0.26/0.53  % Clause-clause subsumption calls (NU) : 0
% 0.26/0.53  % Rec. Clause-clause subsumption calls : 0
% 0.26/0.53  % Non-unit clause-clause subsumptions  : 0
% 0.26/0.53  % Unit Clause-clause subsumption calls : 0
% 0.26/0.53  % Rewrite failures with RHS unbound    : 0
% 0.26/0.53  % BW rewrite match attempts            : 1
% 0.26/0.53  % BW rewrite match successes           : 1
% 0.26/0.53  % Condensation attempts                : 0
% 0.26/0.53  % Condensation successes               : 0
% 0.26/0.53  % Termbank termtop insertions          : 79
% 0.26/0.53  % Search garbage collected termcells   : 4
% 0.26/0.53  
% 0.26/0.53  % -------------------------------------------------
% 0.26/0.53  % User time                : 0.003 s
% 0.26/0.53  % System time              : 0.001 s
% 0.26/0.53  % Total time               : 0.004 s
% 0.26/0.53  % Maximum resident set size: 3628 pages
% 0.26/0.53  
% 0.26/0.53  % -------------------------------------------------
% 0.26/0.53  % User time                : 0.005 s
% 0.26/0.53  % System time              : 0.007 s
% 0.26/0.53  % Total time               : 0.012 s
% 0.26/0.53  % Maximum resident set size: 4864 pages
% 0.26/0.53  % E exiting
%------------------------------------------------------------------------------