↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n006.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 03:00:07 PM UTC 2026

% Result   : Unsatisfiable 3.18s 1.02s
% Output   : CNFRefutation 3.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   23 (  11 unt;   0 nHn;  16 RR)
%            Number of literals    :   38 (   0 equ;  19 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-4 aty)
%            Number of variables   :   46 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_mem__def_0,axiom,
    ( ~ c_in(X2,X1,X3)
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).

cnf(cls_conjecture_6,negated_conjecture,
    ~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).

cnf(cls_insert__subset_2,axiom,
    ( ~ c_in(X1,X4,X3)
    | ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
    | c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__subset_2) ).

cnf(cls_mem__def_1,axiom,
    ( ~ hBOOL(hAPP(X2,X1))
    | c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).

cnf(cls_conjecture_4,negated_conjecture,
    c_in(v_pn,v_U,tc_Com_Opname),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_lessequals(v_G,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_rev__image__eqI_0,axiom,
    ( ~ c_in(X1,X2,X3)
    | c_in(hAPP(X4,X1),c_Set_Oimage(X4,X2,X3,X5),X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_rev__image__eqI_0) ).

cnf(c_0_7,plain,
    ( ~ c_in(X2,X1,X3)
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).

cnf(c_0_8,negated_conjecture,
    ~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).

cnf(c_0_9,plain,
    ( ~ c_in(X1,X4,X3)
    | ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
    | c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) ),
    inference(fof_simplification,[status(thm)],[cls_insert__subset_2]) ).

cnf(c_0_10,plain,
    ( ~ hBOOL(hAPP(X2,X1))
    | c_in(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).

cnf(c_0_11,plain,
    ( ~ c_in(X2,X1,X3)
    | hBOOL(hAPP(X1,X2)) ),
    c_0_7 ).

cnf(c_0_12,negated_conjecture,
    c_in(v_pn,v_U,tc_Com_Opname),
    cls_conjecture_4 ).

cnf(c_0_13,negated_conjecture,
    ~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    c_0_8 ).

cnf(c_0_14,plain,
    ( ~ c_in(X1,X4,X3)
    | ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
    | c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) ),
    c_0_9 ).

cnf(c_0_15,negated_conjecture,
    c_lessequals(v_G,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
    cls_conjecture_1 ).

cnf(c_0_16,plain,
    ( ~ c_in(X1,X2,X3)
    | c_in(hAPP(X4,X1),c_Set_Oimage(X4,X2,X3,X5),X5) ),
    inference(fof_simplification,[status(thm)],[cls_rev__image__eqI_0]) ).

cnf(c_0_17,plain,
    ( ~ hBOOL(hAPP(X2,X1))
    | c_in(X1,X2,X3) ),
    c_0_10 ).

cnf(c_0_18,negated_conjecture,
    hBOOL(hAPP(v_U,v_pn)),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    ~ c_in(hAPP(v_mgt__call,v_pn),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_20,plain,
    ( ~ c_in(X1,X2,X3)
    | c_in(hAPP(X4,X1),c_Set_Oimage(X4,X2,X3,X5),X5) ),
    c_0_16 ).

cnf(c_0_21,negated_conjecture,
    c_in(v_pn,v_U,X1),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV884-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n006.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 09:29:57 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.44  Running first-order theorem proving
% 0.15/0.44  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
% 3.18/1.02  % Version: 3.5.1
% 3.18/1.02  % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.18/1.02  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.18/1.02  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.18/1.02  % Starting new_bool_3 with 300s (1) cores
% 3.18/1.02  % Starting new_bool_1 with 300s (1) cores
% 3.18/1.02  % Starting sh5l with 300s (1) cores
% 3.18/1.02  % new_bool_3 with pid 2523549 completed with status 0
% 3.18/1.02  % Result found by new_bool_3
% 3.18/1.02  % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.18/1.02  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.18/1.02  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.18/1.02  % Starting new_bool_3 with 300s (1) cores
% 3.18/1.02  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.18/1.02  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.18/1.02  % Search class: FGHSM-FSLM32-DFFFFFNN
% 3.18/1.02  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.18/1.02  % Starting SubtermCWHack with 28s (1) cores
% 3.18/1.02  % SubtermCWHack with pid 2523552 completed with status 0
% 3.18/1.02  % Result found by SubtermCWHack
% 3.18/1.02  % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.18/1.02  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.18/1.02  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.18/1.02  % Starting new_bool_3 with 300s (1) cores
% 3.18/1.02  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.18/1.02  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.18/1.02  % Search class: FGHSM-FSLM32-DFFFFFNN
% 3.18/1.02  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.18/1.02  % Starting SubtermCWHack with 28s (1) cores
% 3.18/1.02  % Preprocessing time       : 0.011 s
% 3.18/1.02  
% 3.18/1.02  % Proof found!
% 3.18/1.02  % SZS status Unsatisfiable
% 3.18/1.02  % SZS output start CNFRefutation
% See solution above
% 3.18/1.02  % Parsed axioms                        : 1121
% 3.18/1.02  % Removed by relevancy pruning/SinE    : 505
% 3.18/1.02  % Initial clauses                      : 616
% 3.18/1.02  % Removed in clause preprocessing      : 0
% 3.18/1.02  % Initial clauses in saturation        : 616
% 3.18/1.02  % Processed clauses                    : 4808
% 3.18/1.02  % ...of these trivial                  : 461
% 3.18/1.02  % ...subsumed                          : 3397
% 3.18/1.02  % ...remaining for further processing  : 950
% 3.18/1.02  % Other redundant clauses eliminated   : 70
% 3.18/1.02  % Clauses deleted for lack of memory   : 0
% 3.18/1.02  % Backward-subsumed                    : 7
% 3.18/1.02  % Backward-rewritten                   : 58
% 3.18/1.02  % Generated clauses                    : 25722
% 3.18/1.02  % ...of the previous two non-redundant : 20766
% 3.18/1.02  % ...aggressively subsumed             : 0
% 3.18/1.02  % Contextual simplify-reflections      : 4
% 3.18/1.02  % Paramodulations                      : 25625
% 3.18/1.02  % Factorizations                       : 10
% 3.18/1.02  % NegExts                              : 0
% 3.18/1.02  % Equation resolutions                 : 87
% 3.18/1.02  % Disequality decompositions           : 0
% 3.18/1.02  % Total rewrite steps                  : 19208
% 3.18/1.02  % ...of those cached                   : 17153
% 3.18/1.02  % Propositional unsat checks           : 0
% 3.18/1.02  %    Propositional check models        : 0
% 3.18/1.02  %    Propositional check unsatisfiable : 0
% 3.18/1.02  %    Propositional clauses             : 0
% 3.18/1.02  %    Propositional clauses after purity: 0
% 3.18/1.02  %    Propositional unsat core size     : 0
% 3.18/1.02  %    Propositional preprocessing time  : 0.000
% 3.18/1.02  %    Propositional encoding time       : 0.000
% 3.18/1.02  %    Propositional solver time         : 0.000
% 3.18/1.02  %    Success case prop preproc time    : 0.000
% 3.18/1.02  %    Success case prop encoding time   : 0.000
% 3.18/1.02  %    Success case prop solver time     : 0.000
% 3.18/1.02  % Current number of processed clauses  : 885
% 3.18/1.02  %    Positive orientable unit clauses  : 259
% 3.18/1.02  %    Positive unorientable unit clauses: 11
% 3.18/1.02  %    Negative unit clauses             : 187
% 3.18/1.02  %    Non-unit-clauses                  : 428
% 3.18/1.02  % Current number of unprocessed clauses: 16431
% 3.18/1.02  % ...number of literals in the above   : 31428
% 3.18/1.02  % Current number of archived formulas  : 0
% 3.18/1.02  % Current number of archived clauses   : 65
% 3.18/1.02  % Clause-clause subsumption calls (NU) : 41372
% 3.18/1.02  % Rec. Clause-clause subsumption calls : 35253
% 3.18/1.02  % Non-unit clause-clause subsumptions  : 873
% 3.18/1.02  % Unit Clause-clause subsumption calls : 10962
% 3.18/1.02  % Rewrite failures with RHS unbound    : 11
% 3.18/1.02  % BW rewrite match attempts            : 560
% 3.18/1.02  % BW rewrite match successes           : 102
% 3.18/1.02  % Condensation attempts                : 0
% 3.18/1.02  % Condensation successes               : 0
% 3.18/1.02  % Termbank termtop insertions          : 333985
% 3.18/1.02  % Search garbage collected termcells   : 2911
% 3.18/1.02  
% 3.18/1.02  % -------------------------------------------------
% 3.18/1.02  % User time                : 0.495 s
% 3.18/1.02  % System time              : 0.036 s
% 3.18/1.02  % Total time               : 0.530 s
% 3.18/1.02  % Maximum resident set size: 5132 pages
% 3.18/1.02  
% 3.18/1.02  % -------------------------------------------------
% 3.18/1.02  % User time                : 0.522 s
% 3.18/1.02  % System time              : 0.040 s
% 3.18/1.02  % Total time               : 0.562 s
% 3.18/1.02  % Maximum resident set size: 5376 pages
% 3.18/1.02  % E exiting
%------------------------------------------------------------------------------