↑ 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  : SWV281-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 : n002.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:01:04 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Nat_Oop_A_L_Oadd__Suc_0,axiom,
    c_plus(c_Suc(X1),X2,tc_nat) = c_Suc(c_plus(X1,X2,tc_nat)),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Nat_Oop_A_L_Oadd__Suc_0) ).

cnf(cls_SetInterval_Ocard__atMost_0,axiom,
    c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat) = c_Suc(X1),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_Ocard__atMost_0) ).

cnf(cls_Nat_Oadd__Suc__right_0,axiom,
    c_plus(X1,c_Suc(X2),tc_nat) = c_Suc(c_plus(X1,X2,tc_nat)),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Nat_Oadd__Suc__right_0) ).

cnf(cls_Public_ONonce__supply__lemma_0,axiom,
    ( ~ c_lessequals(v_sko__urX(X2),X1,tc_nat)
    | ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Public_ONonce__supply__lemma_0) ).

cnf(cls_Nat_Onot__add__less1_0,axiom,
    ~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Nat_Onot__add__less1_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Nat_Ole__add2_0,axiom,
    c_lessequals(X1,c_plus(X2,X1,tc_nat),tc_nat),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Ole__add2_0) ).

cnf(cls_Nat_OlessI_0,axiom,
    c_less(X1,c_Suc(X1),tc_nat),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Nat_OlessI_0) ).

cnf(c_0_8,axiom,
    c_plus(c_Suc(X1),X2,tc_nat) = c_Suc(c_plus(X1,X2,tc_nat)),
    cls_Nat_Oop_A_L_Oadd__Suc_0 ).

cnf(c_0_9,axiom,
    c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat) = c_Suc(X1),
    cls_SetInterval_Ocard__atMost_0 ).

cnf(c_0_10,axiom,
    c_plus(X1,c_Suc(X2),tc_nat) = c_Suc(c_plus(X1,X2,tc_nat)),
    cls_Nat_Oadd__Suc__right_0 ).

cnf(c_0_11,plain,
    ( ~ c_lessequals(v_sko__urX(X2),X1,tc_nat)
    | ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_Public_ONonce__supply__lemma_0]) ).

cnf(c_0_12,plain,
    ~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
    inference(fof_simplification,[status(thm)],[cls_Nat_Onot__add__less1_0]) ).

cnf(c_0_13,plain,
    c_plus(c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),X2,tc_nat) = c_Finite__Set_Ocard(c_SetInterval_OatMost(c_plus(X1,X2,tc_nat),tc_nat),tc_nat),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).

cnf(c_0_14,plain,
    c_plus(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X2,tc_nat),tc_nat),tc_nat) = c_Finite__Set_Ocard(c_SetInterval_OatMost(c_plus(X1,X2,tc_nat),tc_nat),tc_nat),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_9]) ).

cnf(c_0_15,plain,
    ( ~ c_lessequals(v_sko__urX(X2),X1,tc_nat)
    | ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg) ),
    c_0_11 ).

cnf(c_0_16,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | X1 = X2 ),
    cls_conjecture_0 ).

cnf(c_0_17,plain,
    ~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
    c_0_12 ).

cnf(c_0_18,plain,
    c_plus(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X2,tc_nat),tc_nat),tc_nat) = c_plus(c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),X2,tc_nat),
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ c_lessequals(v_sko__urX(v_evs),X1,tc_nat)
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,axiom,
    c_lessequals(X1,c_plus(X2,X1,tc_nat),tc_nat),
    cls_Nat_Ole__add2_0 ).

cnf(c_0_21,plain,
    ~ c_less(c_plus(c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),X2,tc_nat),X1,tc_nat),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | c_plus(X1,v_sko__urX(v_evs),tc_nat) = X2 ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,axiom,
    c_less(X1,c_Suc(X1),tc_nat),
    cls_Nat_OlessI_0 ).

cnf(c_0_24,negated_conjecture,
    ( ~ c_less(X1,X2,tc_nat)
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,plain,
    c_less(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),tc_nat),
    inference(rw,[status(thm)],[c_0_23,c_0_9]) ).

cnf(c_0_26,negated_conjecture,
    c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_27,negated_conjecture,
    ~ c_lessequals(v_sko__urX(v_evs_H),X1,tc_nat),
    inference(spm,[status(thm)],[c_0_15,c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_27,c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV281-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.44  % Computer : n002.cluster.edu
% 0.16/0.44  % Model    : x86_64 x86_64
% 0.16/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44  % Memory   : 8046.5625MB
% 0.16/0.44  % OS       : Linux 6.8.0-71-generic
% 0.16/0.44  % CPULimit : 300
% 0.16/0.44  % WCLimit  : 300
% 0.16/0.44  % DateTime : Mon Sep 21 08:40:32 UTC 2026
% 0.16/0.44  % CPUTime  : 
% 0.16/0.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.51  Running first-order theorem proving
% 0.27/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
% 8.44/1.93  % Version: 3.5.1
% 8.44/1.93  % Preprocessing class: FMLMSMSMSSSNFFN.
% 8.44/1.93  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.44/1.93  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.44/1.93  % Starting new_bool_3 with 300s (1) cores
% 8.44/1.93  % Starting new_bool_1 with 300s (1) cores
% 8.44/1.93  % Starting sh5l with 300s (1) cores
% 8.44/1.93  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2896976 completed with status 0
% 8.44/1.93  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.44/1.93  % Preprocessing class: FMLMSMSMSSSNFFN.
% 8.44/1.93  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.44/1.93  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.44/1.93  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.44/1.93  % No SInE strategy applied
% 8.44/1.93  % Search class: FGHSM-SMLM32-DFFFFFNN
% 8.44/1.93  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 8.44/1.93  % Starting SubtermCWHack with 136s (1) cores
% 8.44/1.93  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.44/1.93  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 8.44/1.93  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 8.44/1.93  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 8.44/1.93  % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2896987 completed with status 0
% 8.44/1.93  % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.44/1.93  % Preprocessing class: FMLMSMSMSSSNFFN.
% 8.44/1.93  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.44/1.93  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.44/1.93  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.44/1.93  % No SInE strategy applied
% 8.44/1.93  % Search class: FGHSM-SMLM32-DFFFFFNN
% 8.44/1.93  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 8.44/1.93  % Starting SubtermCWHack with 136s (1) cores
% 8.44/1.93  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.44/1.93  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 8.44/1.93  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 8.44/1.93  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 8.44/1.93  % Preprocessing time       : 0.029 s
% 8.44/1.93  % Presaturation interreduction done
% 8.44/1.93  
% 8.44/1.93  % Proof found!
% 8.44/1.93  % SZS status Unsatisfiable
% 8.44/1.93  % SZS output start CNFRefutation
% See solution above
% 8.44/1.93  % Parsed axioms                        : 2938
% 8.44/1.93  % Removed by relevancy pruning/SinE    : 0
% 8.44/1.93  % Initial clauses                      : 2938
% 8.44/1.93  % Removed in clause preprocessing      : 12
% 8.44/1.93  % Initial clauses in saturation        : 2926
% 8.44/1.93  % Processed clauses                    : 8395
% 8.44/1.93  % ...of these trivial                  : 33
% 8.44/1.93  % ...subsumed                          : 2957
% 8.44/1.93  % ...remaining for further processing  : 5405
% 8.44/1.93  % Other redundant clauses eliminated   : 894
% 8.44/1.93  % Clauses deleted for lack of memory   : 0
% 8.44/1.93  % Backward-subsumed                    : 28
% 8.44/1.93  % Backward-rewritten                   : 97
% 8.44/1.93  % Generated clauses                    : 20390
% 8.44/1.93  % ...of the previous two non-redundant : 17913
% 8.44/1.93  % ...aggressively subsumed             : 0
% 8.44/1.93  % Contextual simplify-reflections      : 7
% 8.44/1.93  % Paramodulations                      : 19445
% 8.44/1.93  % Factorizations                       : 0
% 8.44/1.93  % NegExts                              : 0
% 8.44/1.93  % Equation resolutions                 : 945
% 8.44/1.93  % Disequality decompositions           : 0
% 8.44/1.93  % Total rewrite steps                  : 4836
% 8.44/1.93  % ...of those cached                   : 3683
% 8.44/1.93  % Propositional unsat checks           : 1
% 8.44/1.93  %    Propositional check models        : 1
% 8.44/1.93  %    Propositional check unsatisfiable : 0
% 8.44/1.93  %    Propositional clauses             : 0
% 8.44/1.93  %    Propositional clauses after purity: 0
% 8.44/1.93  %    Propositional unsat core size     : 0
% 8.44/1.93  %    Propositional preprocessing time  : 0.000
% 8.44/1.93  %    Propositional encoding time       : 0.009
% 8.44/1.93  %    Propositional solver time         : 0.009
% 8.44/1.93  %    Success case prop preproc time    : 0.000
% 8.44/1.93  %    Success case prop encoding time   : 0.000
% 8.44/1.93  %    Success case prop solver time     : 0.000
% 8.44/1.93  % Current number of processed clauses  : 2518
% 8.44/1.93  %    Positive orientable unit clauses  : 627
% 8.44/1.93  %    Positive unorientable unit clauses: 20
% 8.44/1.93  %    Negative unit clauses             : 403
% 8.44/1.93  %    Non-unit-clauses                  : 1468
% 8.44/1.93  % Current number of unprocessed clauses: 15196
% 8.44/1.93  % ...number of literals in the above   : 38000
% 8.44/1.93  % Current number of archived formulas  : 0
% 8.44/1.93  % Current number of archived clauses   : 2897
% 8.44/1.93  % Clause-clause subsumption calls (NU) : 3267408
% 8.44/1.93  % Rec. Clause-clause subsumption calls : 2245879
% 8.44/1.93  % Non-unit clause-clause subsumptions  : 2240
% 8.44/1.93  % Unit Clause-clause subsumption calls : 148764
% 8.44/1.93  % Rewrite failures with RHS unbound    : 0
% 8.44/1.93  % BW rewrite match attempts            : 838
% 8.44/1.93  % BW rewrite match successes           : 75
% 8.44/1.93  % Condensation attempts                : 0
% 8.44/1.93  % Condensation successes               : 0
% 8.44/1.93  % Termbank termtop insertions          : 357189
% 8.44/1.93  % Search garbage collected termcells   : 4234
% 8.44/1.93  
% 8.44/1.93  % -------------------------------------------------
% 8.44/1.93  % User time                : 1.176 s
% 8.44/1.93  % System time              : 0.052 s
% 8.44/1.93  % Total time               : 1.228 s
% 8.44/1.93  % Maximum resident set size: 8860 pages
% 8.44/1.93  
% 8.44/1.93  % -------------------------------------------------
% 8.44/1.93  % User time                : 5.529 s
% 8.44/1.93  % System time              : 0.225 s
% 8.44/1.93  % Total time               : 5.754 s
% 8.44/1.93  % Maximum resident set size: 6400 pages
% 8.44/1.93  % E exiting
%------------------------------------------------------------------------------