↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SWV239-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 : n008.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:53 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    ~ c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Message_Oanalz__subset__cong_0,axiom,
    ( ~ c_lessequals(c_Message_Oanalz(X3),c_Message_Oanalz(X4),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_Oanalz(c_union(X3,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(X4,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__subset__cong_0) ).

cnf(cls_Set_Osubset__refl_0,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_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_Message_Oanalz__analzD__dest_0,axiom,
    ( ~ c_in(X1,c_Message_Oanalz(c_Message_Oanalz(X2)),tc_Message_Omsg)
    | c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV004-0.ax',cls_Message_Oanalz__analzD__dest_0) ).

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(c_0_6,negated_conjecture,
    ~ c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_7,plain,
    ( ~ c_lessequals(c_Message_Oanalz(X3),c_Message_Oanalz(X4),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_Oanalz(c_union(X3,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(X4,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__subset__cong_0]) ).

cnf(c_0_8,negated_conjecture,
    ~ c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    c_0_6 ).

cnf(c_0_9,plain,
    ( ~ c_lessequals(c_Message_Oanalz(X3),c_Message_Oanalz(X4),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_Oanalz(c_union(X3,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(X4,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    c_0_7 ).

cnf(c_0_10,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    cls_Set_Osubset__refl_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_Message_Oanalz(c_Message_Oanalz(X2)),tc_Message_Omsg)
    | c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__analzD__dest_0]) ).

cnf(c_0_13,negated_conjecture,
    ~ c_lessequals(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_set(tc_Message_Omsg)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

cnf(c_0_14,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_15,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_16,plain,
    ( ~ c_in(X1,c_Message_Oanalz(c_Message_Oanalz(X2)),tc_Message_Omsg)
    | c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg) ),
    c_0_12 ).

cnf(c_0_17,negated_conjecture,
    c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_Message_Omsg),c_Message_Oanalz(c_Message_Oanalz(v_G)),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ~ c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_Message_Omsg),c_Message_Oanalz(v_G),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_13,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV239-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.54  % Computer : n008.cluster.edu
% 0.11/0.54  % Model    : x86_64 x86_64
% 0.11/0.54  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.54  % Memory   : 8046.5625MB
% 0.11/0.54  % OS       : Linux 6.8.0-71-generic
% 0.11/0.54  % CPULimit : 300
% 0.11/0.54  % WCLimit  : 300
% 0.11/0.54  % DateTime : Mon Sep 21 08:36:09 UTC 2026
% 0.11/0.54  % CPUTime  : 
% 0.11/0.54  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.57  Running first-order theorem proving
% 0.15/0.57  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.15/1.00  % Version: 3.5.1
% 0.15/1.00  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/1.00  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/1.00  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/1.00  % Starting new_bool_3 with 300s (1) cores
% 0.15/1.00  % Starting new_bool_1 with 300s (1) cores
% 0.15/1.00  % Starting sh5l with 300s (1) cores
% 0.15/1.00  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 600141 completed with status 0
% 0.15/1.00  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/1.00  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/1.00  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/1.00  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/1.00  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/1.00  % No SInE strategy applied
% 0.15/1.00  % Search class: FGHSM-SSLM32-MFFFFFNN
% 0.15/1.00  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/1.00  % Starting SubtermCWHack with 136s (1) cores
% 0.15/1.00  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/1.00  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/1.00  % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 0.15/1.00  % Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/1.00  % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 600151 completed with status 0
% 0.15/1.00  % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 0.15/1.00  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/1.00  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/1.00  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/1.00  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/1.00  % No SInE strategy applied
% 0.15/1.00  % Search class: FGHSM-SSLM32-MFFFFFNN
% 0.15/1.00  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/1.00  % Starting SubtermCWHack with 136s (1) cores
% 0.15/1.00  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/1.00  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/1.00  % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 0.15/1.00  % Preprocessing time       : 0.011 s
% 0.15/1.00  % Presaturation interreduction done
% 0.15/1.00  
% 0.15/1.00  % Proof found!
% 0.15/1.00  % SZS status Unsatisfiable
% 0.15/1.00  % SZS output start CNFRefutation
% See solution above
% 0.15/1.00  % Parsed axioms                        : 1400
% 0.15/1.00  % Removed by relevancy pruning/SinE    : 0
% 0.15/1.00  % Initial clauses                      : 1400
% 0.15/1.00  % Removed in clause preprocessing      : 1
% 0.15/1.00  % Initial clauses in saturation        : 1399
% 0.15/1.00  % Processed clauses                    : 3004
% 0.15/1.00  % ...of these trivial                  : 8
% 0.15/1.00  % ...subsumed                          : 352
% 0.15/1.00  % ...remaining for further processing  : 2644
% 0.15/1.00  % Other redundant clauses eliminated   : 4
% 0.15/1.00  % Clauses deleted for lack of memory   : 0
% 0.15/1.00  % Backward-subsumed                    : 1
% 0.15/1.00  % Backward-rewritten                   : 6
% 0.15/1.00  % Generated clauses                    : 3665
% 0.15/1.00  % ...of the previous two non-redundant : 2850
% 0.15/1.00  % ...aggressively subsumed             : 0
% 0.15/1.00  % Contextual simplify-reflections      : 2
% 0.15/1.00  % Paramodulations                      : 3624
% 0.15/1.00  % Factorizations                       : 0
% 0.15/1.00  % NegExts                              : 0
% 0.15/1.00  % Equation resolutions                 : 41
% 0.15/1.00  % Disequality decompositions           : 0
% 0.15/1.00  % Total rewrite steps                  : 833
% 0.15/1.00  % ...of those cached                   : 731
% 0.15/1.00  % Propositional unsat checks           : 0
% 0.15/1.00  %    Propositional check models        : 0
% 0.15/1.00  %    Propositional check unsatisfiable : 0
% 0.15/1.00  %    Propositional clauses             : 0
% 0.15/1.00  %    Propositional clauses after purity: 0
% 0.15/1.00  %    Propositional unsat core size     : 0
% 0.15/1.00  %    Propositional preprocessing time  : 0.000
% 0.15/1.00  %    Propositional encoding time       : 0.000
% 0.15/1.00  %    Propositional solver time         : 0.000
% 0.15/1.00  %    Success case prop preproc time    : 0.000
% 0.15/1.00  %    Success case prop encoding time   : 0.000
% 0.15/1.00  %    Success case prop solver time     : 0.000
% 0.15/1.00  % Current number of processed clauses  : 1277
% 0.15/1.00  %    Positive orientable unit clauses  : 177
% 0.15/1.00  %    Positive unorientable unit clauses: 0
% 0.15/1.00  %    Negative unit clauses             : 48
% 0.15/1.00  %    Non-unit-clauses                  : 1052
% 0.15/1.00  % Current number of unprocessed clauses: 2604
% 0.15/1.00  % ...number of literals in the above   : 5276
% 0.15/1.00  % Current number of archived formulas  : 0
% 0.15/1.00  % Current number of archived clauses   : 1367
% 0.15/1.00  % Clause-clause subsumption calls (NU) : 987344
% 0.15/1.00  % Rec. Clause-clause subsumption calls : 964422
% 0.15/1.00  % Non-unit clause-clause subsumptions  : 326
% 0.15/1.00  % Unit Clause-clause subsumption calls : 13193
% 0.15/1.00  % Rewrite failures with RHS unbound    : 0
% 0.15/1.00  % BW rewrite match attempts            : 62
% 0.15/1.00  % BW rewrite match successes           : 6
% 0.15/1.00  % Condensation attempts                : 0
% 0.15/1.00  % Condensation successes               : 0
% 0.15/1.00  % Termbank termtop insertions          : 62116
% 0.15/1.00  % Search garbage collected termcells   : 1692
% 0.15/1.00  
% 0.15/1.00  % -------------------------------------------------
% 0.15/1.00  % User time                : 0.333 s
% 0.15/1.00  % System time              : 0.018 s
% 0.15/1.00  % Total time               : 0.351 s
% 0.15/1.00  % Maximum resident set size: 5864 pages
% 0.15/1.00  
% 0.15/1.00  % -------------------------------------------------
% 0.15/1.00  % User time                : 1.718 s
% 0.15/1.00  % System time              : 0.074 s
% 0.15/1.00  % Total time               : 1.792 s
% 0.15/1.00  % Maximum resident set size: 5632 pages
% 0.15/1.00  % E exiting
%------------------------------------------------------------------------------