↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET830-1 : 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 : n011.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 3.50s 0.93s
% Output   : CNFRefutation 3.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   36 (  11 unt;   4 nHn;  30 RR)
%            Number of literals    :   71 (   0 equ;  34 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   83 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_OIntE_0,axiom,
    ( ~ c_in(X1,c_inter(X2,X3,X4),X4)
    | c_in(X1,X3,X4) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OIntE_0) ).

cnf(cls_Set_OsubsetI_1,axiom,
    ( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).

cnf(cls_Set_OsubsetI_0,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).

cnf(cls_Set_OIntE_1,axiom,
    ( ~ c_in(X1,c_inter(X2,X3,X4),X4)
    | c_in(X1,X2,X4) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OIntE_1) ).

cnf(cls_conjecture_5,negated_conjecture,
    ( ~ c_lessequals(X1,v_Y,tc_set(t_a))
    | ~ c_lessequals(X1,v_Z,tc_set(t_a))
    | c_lessequals(X1,v_X,tc_set(t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

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/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).

cnf(cls_Set_OIntI_0,axiom,
    ( ~ c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | c_in(X1,c_inter(X4,X2,X3),X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OIntI_0) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ c_in(v_x,v_X,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

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

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

cnf(c_0_10,plain,
    ( ~ c_in(X1,c_inter(X2,X3,X4),X4)
    | c_in(X1,X3,X4) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OIntE_0]) ).

cnf(c_0_11,plain,
    ( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).

cnf(c_0_12,plain,
    ( ~ c_in(X1,c_inter(X2,X3,X4),X4)
    | c_in(X1,X3,X4) ),
    c_0_10 ).

cnf(c_0_13,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
    cls_Set_OsubsetI_0 ).

cnf(c_0_14,plain,
    ( ~ c_in(X1,c_inter(X2,X3,X4),X4)
    | c_in(X1,X2,X4) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OIntE_1]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ c_lessequals(X1,v_Y,tc_set(t_a))
    | ~ c_lessequals(X1,v_Z,tc_set(t_a))
    | c_lessequals(X1,v_X,tc_set(t_a)) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).

cnf(c_0_16,plain,
    ( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    c_0_11 ).

cnf(c_0_17,plain,
    ( c_in(c_Main_OsubsetI__1(c_inter(X1,X2,X3),X4,X3),X2,X3)
    | c_lessequals(c_inter(X1,X2,X3),X4,tc_set(X3)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,plain,
    ( ~ c_in(X1,c_inter(X2,X3,X4),X4)
    | c_in(X1,X2,X4) ),
    c_0_14 ).

cnf(c_0_19,negated_conjecture,
    ( ~ c_lessequals(X1,v_Y,tc_set(t_a))
    | ~ c_lessequals(X1,v_Z,tc_set(t_a))
    | c_lessequals(X1,v_X,tc_set(t_a)) ),
    c_0_15 ).

cnf(c_0_20,plain,
    c_lessequals(c_inter(X1,X2,X3),X2,tc_set(X3)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,plain,
    ( c_in(c_Main_OsubsetI__1(c_inter(X1,X2,X3),X4,X3),X1,X3)
    | c_lessequals(c_inter(X1,X2,X3),X4,tc_set(X3)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_13]) ).

cnf(c_0_22,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_23,negated_conjecture,
    ( ~ c_lessequals(c_inter(X1,v_Z,t_a),v_Y,tc_set(t_a))
    | c_lessequals(c_inter(X1,v_Z,t_a),v_X,tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    c_lessequals(c_inter(X1,X2,X3),X1,tc_set(X3)),
    inference(spm,[status(thm)],[c_0_16,c_0_21]) ).

cnf(c_0_25,plain,
    ( ~ c_lessequals(X2,X4,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | c_in(X1,X4,X3) ),
    c_0_22 ).

cnf(c_0_26,negated_conjecture,
    c_lessequals(c_inter(v_Y,v_Z,t_a),v_X,tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,plain,
    ( ~ c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | c_in(X1,c_inter(X4,X2,X3),X3) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OIntI_0]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ c_in(X1,c_inter(v_Y,v_Z,t_a),t_a)
    | c_in(X1,v_X,t_a) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,plain,
    ( ~ c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | c_in(X1,c_inter(X4,X2,X3),X3) ),
    c_0_27 ).

cnf(c_0_30,negated_conjecture,
    ~ c_in(v_x,v_X,t_a),
    inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ c_in(X1,v_Z,t_a)
    | ~ c_in(X1,v_Y,t_a)
    | c_in(X1,v_X,t_a) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    c_in(v_x,v_Z,t_a),
    cls_conjecture_3 ).

cnf(c_0_33,negated_conjecture,
    c_in(v_x,v_Y,t_a),
    cls_conjecture_2 ).

cnf(c_0_34,negated_conjecture,
    ~ c_in(v_x,v_X,t_a),
    c_0_30 ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET830-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n011.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 05:39:56 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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.50/0.93  % Version: 3.5.1
% 3.50/0.93  % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.50/0.93  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.50/0.93  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.50/0.93  % Starting new_bool_3 with 300s (1) cores
% 3.50/0.93  % Starting new_bool_1 with 300s (1) cores
% 3.50/0.93  % Starting sh5l with 300s (1) cores
% 3.50/0.93  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1081630 completed with status 0
% 3.50/0.93  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.50/0.93  % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.50/0.93  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.50/0.93  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.50/0.93  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.50/0.93  % No SInE strategy applied
% 3.50/0.93  % Search class: FGHSM-SSLM33-MFFFFFNN
% 3.50/0.93  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.50/0.93  % Starting SubtermCWHack with 136s (1) cores
% 3.50/0.93  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.50/0.93  % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 3.50/0.93  % Starting new_bool_3 with 136s (1) cores
% 3.50/0.93  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 3.50/0.93  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1081638 completed with status 0
% 3.50/0.93  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.50/0.93  % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.50/0.93  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.50/0.93  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.50/0.93  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.50/0.93  % No SInE strategy applied
% 3.50/0.93  % Search class: FGHSM-SSLM33-MFFFFFNN
% 3.50/0.93  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.50/0.93  % Starting SubtermCWHack with 136s (1) cores
% 3.50/0.93  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.50/0.93  % Preprocessing time       : 0.012 s
% 3.50/0.93  % Presaturation interreduction done
% 3.50/0.93  
% 3.50/0.93  % Proof found!
% 3.50/0.93  % SZS status Unsatisfiable
% 3.50/0.93  % SZS output start CNFRefutation
% See solution above
% 3.50/0.93  % Parsed axioms                        : 1363
% 3.50/0.93  % Removed by relevancy pruning/SinE    : 0
% 3.50/0.93  % Initial clauses                      : 1363
% 3.50/0.93  % Removed in clause preprocessing      : 1
% 3.50/0.93  % Initial clauses in saturation        : 1362
% 3.50/0.93  % Processed clauses                    : 6174
% 3.50/0.93  % ...of these trivial                  : 30
% 3.50/0.93  % ...subsumed                          : 2973
% 3.50/0.93  % ...remaining for further processing  : 3171
% 3.50/0.93  % Other redundant clauses eliminated   : 31
% 3.50/0.93  % Clauses deleted for lack of memory   : 0
% 3.50/0.93  % Backward-subsumed                    : 10
% 3.50/0.93  % Backward-rewritten                   : 81
% 3.50/0.93  % Generated clauses                    : 8270
% 3.50/0.93  % ...of the previous two non-redundant : 7048
% 3.50/0.93  % ...aggressively subsumed             : 0
% 3.50/0.93  % Contextual simplify-reflections      : 1
% 3.50/0.93  % Paramodulations                      : 8209
% 3.50/0.93  % Factorizations                       : 0
% 3.50/0.93  % NegExts                              : 0
% 3.50/0.93  % Equation resolutions                 : 61
% 3.50/0.93  % Disequality decompositions           : 0
% 3.50/0.93  % Total rewrite steps                  : 1781
% 3.50/0.93  % ...of those cached                   : 1387
% 3.50/0.93  % Propositional unsat checks           : 0
% 3.50/0.93  %    Propositional check models        : 0
% 3.50/0.93  %    Propositional check unsatisfiable : 0
% 3.50/0.93  %    Propositional clauses             : 0
% 3.50/0.93  %    Propositional clauses after purity: 0
% 3.50/0.93  %    Propositional unsat core size     : 0
% 3.50/0.93  %    Propositional preprocessing time  : 0.000
% 3.50/0.93  %    Propositional encoding time       : 0.000
% 3.50/0.93  %    Propositional solver time         : 0.000
% 3.50/0.93  %    Success case prop preproc time    : 0.000
% 3.50/0.93  %    Success case prop encoding time   : 0.000
% 3.50/0.93  %    Success case prop solver time     : 0.000
% 3.50/0.93  % Current number of processed clauses  : 1754
% 3.50/0.93  %    Positive orientable unit clauses  : 249
% 3.50/0.93  %    Positive unorientable unit clauses: 0
% 3.50/0.93  %    Negative unit clauses             : 99
% 3.50/0.93  %    Non-unit-clauses                  : 1406
% 3.50/0.93  % Current number of unprocessed clauses: 3451
% 3.50/0.93  % ...number of literals in the above   : 7375
% 3.50/0.93  % Current number of archived formulas  : 0
% 3.50/0.93  % Current number of archived clauses   : 1417
% 3.50/0.93  % Clause-clause subsumption calls (NU) : 1443161
% 3.50/0.93  % Rec. Clause-clause subsumption calls : 1331865
% 3.50/0.93  % Non-unit clause-clause subsumptions  : 2874
% 3.50/0.93  % Unit Clause-clause subsumption calls : 47484
% 3.50/0.93  % Rewrite failures with RHS unbound    : 0
% 3.50/0.93  % BW rewrite match attempts            : 180
% 3.50/0.93  % BW rewrite match successes           : 62
% 3.50/0.93  % Condensation attempts                : 0
% 3.50/0.93  % Condensation successes               : 0
% 3.50/0.93  % Termbank termtop insertions          : 136325
% 3.50/0.93  % Search garbage collected termcells   : 1595
% 3.50/0.93  
% 3.50/0.93  % -------------------------------------------------
% 3.50/0.93  % User time                : 0.431 s
% 3.50/0.93  % System time              : 0.020 s
% 3.50/0.93  % Total time               : 0.452 s
% 3.50/0.93  % Maximum resident set size: 5628 pages
% 3.50/0.93  
% 3.50/0.93  % -------------------------------------------------
% 3.50/0.93  % User time                : 2.050 s
% 3.50/0.93  % System time              : 0.136 s
% 3.50/0.93  % Total time               : 2.186 s
% 3.50/0.93  % Maximum resident set size: 5376 pages
% 3.50/0.93  % E exiting
%------------------------------------------------------------------------------