↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n014.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 02:15:30 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_OsubsetD_0,axiom,
    ( ~ c_lessequals(X2,X4,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | c_in(X1,X4,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_in(v_x,v_Z,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_lessequals(v_X,v_Z,tc_set(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_in(v_x,v_X,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(c_0_4,plain,
    ( ~ c_lessequals(X2,X4,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | c_in(X1,X4,X3) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).

cnf(c_0_5,negated_conjecture,
    ~ c_in(v_x,v_Z,t_a),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

cnf(c_0_6,plain,
    ( ~ c_lessequals(X2,X4,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | c_in(X1,X4,X3) ),
    c_0_4 ).

cnf(c_0_7,negated_conjecture,
    c_lessequals(v_X,v_Z,tc_set(t_a)),
    cls_conjecture_1 ).

cnf(c_0_8,negated_conjecture,
    ~ c_in(v_x,v_Z,t_a),
    c_0_5 ).

cnf(c_0_9,negated_conjecture,
    ( ~ c_in(X1,v_X,t_a)
    | c_in(X1,v_Z,t_a) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    c_in(v_x,v_X,t_a),
    cls_conjecture_2 ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SET829-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.57  % Computer : n014.cluster.edu
% 0.18/0.57  % Model    : x86_64 x86_64
% 0.18/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.57  % Memory   : 8046.5625MB
% 0.18/0.57  % OS       : Linux 6.8.0-71-generic
% 0.18/0.58  % CPULimit : 300
% 0.18/0.58  % WCLimit  : 300
% 0.18/0.58  % DateTime : Mon Sep 21 05:39:50 UTC 2026
% 0.18/0.58  % CPUTime  : 
% 0.18/0.58  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.65  Running first-order theorem proving
% 0.21/0.65  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.74  % Version: 3.5.1
% 0.21/0.74  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.74  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.74  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.74  % Starting new_bool_3 with 300s (1) cores
% 0.21/0.74  % Starting new_bool_1 with 300s (1) cores
% 0.21/0.74  % Starting sh5l with 300s (1) cores
% 0.21/0.74  % new_bool_1 with pid 3248842 completed with status 0
% 0.21/0.74  % Result found by new_bool_1
% 0.21/0.74  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.74  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.74  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.74  % Starting new_bool_3 with 300s (1) cores
% 0.21/0.74  % Starting new_bool_1 with 300s (1) cores
% 0.21/0.74  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.74  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.74  % Search class: FGHSM-FSLM32-SFFFFFNN
% 0.21/0.74  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.74  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.74  % SubtermCWHack with pid 3248845 completed with status 0
% 0.21/0.74  % Result found by SubtermCWHack
% 0.21/0.74  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.74  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.74  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.74  % Starting new_bool_3 with 300s (1) cores
% 0.21/0.74  % Starting new_bool_1 with 300s (1) cores
% 0.21/0.74  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.74  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.74  % Search class: FGHSM-FSLM32-SFFFFFNN
% 0.21/0.74  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.74  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.74  % Preprocessing time       : 0.003 s
% 0.21/0.74  
% 0.21/0.74  % Proof found!
% 0.21/0.74  % SZS status Unsatisfiable
% 0.21/0.74  % SZS output start CNFRefutation
% See solution above
% 0.21/0.74  % Parsed axioms                        : 1362
% 0.21/0.74  % Removed by relevancy pruning/SinE    : 977
% 0.21/0.74  % Initial clauses                      : 385
% 0.21/0.74  % Removed in clause preprocessing      : 0
% 0.21/0.74  % Initial clauses in saturation        : 385
% 0.21/0.74  % Processed clauses                    : 457
% 0.21/0.74  % ...of these trivial                  : 0
% 0.21/0.74  % ...subsumed                          : 74
% 0.21/0.74  % ...remaining for further processing  : 383
% 0.21/0.74  % Other redundant clauses eliminated   : 0
% 0.21/0.74  % Clauses deleted for lack of memory   : 0
% 0.21/0.74  % Backward-subsumed                    : 2
% 0.21/0.74  % Backward-rewritten                   : 2
% 0.21/0.74  % Generated clauses                    : 135
% 0.21/0.74  % ...of the previous two non-redundant : 81
% 0.21/0.74  % ...aggressively subsumed             : 0
% 0.21/0.74  % Contextual simplify-reflections      : 0
% 0.21/0.74  % Paramodulations                      : 133
% 0.21/0.74  % Factorizations                       : 0
% 0.21/0.74  % NegExts                              : 0
% 0.21/0.74  % Equation resolutions                 : 2
% 0.21/0.74  % Disequality decompositions           : 0
% 0.21/0.74  % Total rewrite steps                  : 55
% 0.21/0.74  % ...of those cached                   : 26
% 0.21/0.74  % Propositional unsat checks           : 0
% 0.21/0.74  %    Propositional check models        : 0
% 0.21/0.74  %    Propositional check unsatisfiable : 0
% 0.21/0.74  %    Propositional clauses             : 0
% 0.21/0.74  %    Propositional clauses after purity: 0
% 0.21/0.74  %    Propositional unsat core size     : 0
% 0.21/0.74  %    Propositional preprocessing time  : 0.000
% 0.21/0.74  %    Propositional encoding time       : 0.000
% 0.21/0.74  %    Propositional solver time         : 0.000
% 0.21/0.74  %    Success case prop preproc time    : 0.000
% 0.21/0.74  %    Success case prop encoding time   : 0.000
% 0.21/0.74  %    Success case prop solver time     : 0.000
% 0.21/0.74  % Current number of processed clauses  : 379
% 0.21/0.74  %    Positive orientable unit clauses  : 37
% 0.21/0.74  %    Positive unorientable unit clauses: 0
% 0.21/0.74  %    Negative unit clauses             : 5
% 0.21/0.74  %    Non-unit-clauses                  : 337
% 0.21/0.74  % Current number of unprocessed clauses: 9
% 0.21/0.74  % ...number of literals in the above   : 20
% 0.21/0.74  % Current number of archived formulas  : 0
% 0.21/0.74  % Current number of archived clauses   : 4
% 0.21/0.74  % Clause-clause subsumption calls (NU) : 31004
% 0.21/0.74  % Rec. Clause-clause subsumption calls : 30994
% 0.21/0.74  % Non-unit clause-clause subsumptions  : 74
% 0.21/0.74  % Unit Clause-clause subsumption calls : 376
% 0.21/0.74  % Rewrite failures with RHS unbound    : 0
% 0.21/0.74  % BW rewrite match attempts            : 6
% 0.21/0.74  % BW rewrite match successes           : 2
% 0.21/0.74  % Condensation attempts                : 0
% 0.21/0.74  % Condensation successes               : 0
% 0.21/0.74  % Termbank termtop insertions          : 15308
% 0.21/0.74  % Search garbage collected termcells   : 2485
% 0.21/0.74  
% 0.21/0.74  % -------------------------------------------------
% 0.21/0.74  % User time                : 0.026 s
% 0.21/0.74  % System time              : 0.004 s
% 0.21/0.74  % Total time               : 0.030 s
% 0.21/0.74  % Maximum resident set size: 4860 pages
% 0.21/0.74  
% 0.21/0.74  % -------------------------------------------------
% 0.21/0.74  % User time                : 0.058 s
% 0.21/0.74  % System time              : 0.015 s
% 0.21/0.74  % Total time               : 0.073 s
% 0.21/0.74  % Maximum resident set size: 5376 pages
% 0.21/0.74  % E exiting
%------------------------------------------------------------------------------