↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV280-2 : 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 : n026.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:54:12 PM UTC 2026

% Result   : Unsatisfiable 0.11s 0.42s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   6 unt;   0 nHn;   5 RR)
%            Number of literals    :   12 (   0 equ;   7 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 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   :   13 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
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_conjecture_0,negated_conjecture,
    c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

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

cnf(c_0_3,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_4,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_3 ).

cnf(c_0_5,negated_conjecture,
    c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg),
    cls_conjecture_0 ).

cnf(c_0_6,negated_conjecture,
    ~ c_lessequals(v_sko__urX(v_evs),X1,tc_nat),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,axiom,
    c_lessequals(X1,c_plus(X1,X2,tc_nat),tc_nat),
    cls_Nat_Ole__add1_0 ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_6,c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV280-2 : 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.36  % Computer : n026.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 08:40:22 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40  Running first-order theorem proving
% 0.11/0.40  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.11/0.42  % Version: 3.5.1
% 0.11/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.42  % Starting sh5l with 300s (1) cores
% 0.11/0.42  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1864992 completed with status 0
% 0.11/0.42  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.42  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.42  % No SInE strategy applied
% 0.11/0.42  % Search class: FUHNS-FFSF31-SFFFFFNN
% 0.11/0.42  % partial match(2): FGHNS-FFSF21-SFFFFFNN
% 0.11/0.42  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.42  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.42  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.42  % Starting new_bool_3 with 136s (1) cores
% 0.11/0.42  % Starting new_bool_1 with 136s (1) cores
% 0.11/0.42  % SubtermCWHack with pid 1864997 completed with status 0
% 0.11/0.42  % Result found by SubtermCWHack
% 0.11/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.42  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.42  % No SInE strategy applied
% 0.11/0.42  % Search class: FUHNS-FFSF31-SFFFFFNN
% 0.11/0.42  % partial match(2): FGHNS-FFSF21-SFFFFFNN
% 0.11/0.42  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.42  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.42  % Preprocessing time       : 0.001 s
% 0.11/0.42  
% 0.11/0.42  % Proof found!
% 0.11/0.42  % SZS status Unsatisfiable
% 0.11/0.42  % SZS output start CNFRefutation
% See solution above
% 0.11/0.42  % Parsed axioms                        : 3
% 0.11/0.42  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.42  % Initial clauses                      : 3
% 0.11/0.42  % Removed in clause preprocessing      : 0
% 0.11/0.42  % Initial clauses in saturation        : 3
% 0.11/0.42  % Processed clauses                    : 4
% 0.11/0.42  % ...of these trivial                  : 0
% 0.11/0.42  % ...subsumed                          : 0
% 0.11/0.42  % ...remaining for further processing  : 4
% 0.11/0.42  % Other redundant clauses eliminated   : 0
% 0.11/0.42  % Clauses deleted for lack of memory   : 0
% 0.11/0.42  % Backward-subsumed                    : 0
% 0.11/0.42  % Backward-rewritten                   : 0
% 0.11/0.42  % Generated clauses                    : 2
% 0.11/0.42  % ...of the previous two non-redundant : 1
% 0.11/0.42  % ...aggressively subsumed             : 0
% 0.11/0.42  % Contextual simplify-reflections      : 0
% 0.11/0.42  % Paramodulations                      : 2
% 0.11/0.42  % Factorizations                       : 0
% 0.11/0.42  % NegExts                              : 0
% 0.11/0.42  % Equation resolutions                 : 0
% 0.11/0.42  % Disequality decompositions           : 0
% 0.11/0.42  % Total rewrite steps                  : 0
% 0.11/0.42  % ...of those cached                   : 0
% 0.11/0.42  % Propositional unsat checks           : 0
% 0.11/0.42  %    Propositional check models        : 0
% 0.11/0.42  %    Propositional check unsatisfiable : 0
% 0.11/0.42  %    Propositional clauses             : 0
% 0.11/0.42  %    Propositional clauses after purity: 0
% 0.11/0.42  %    Propositional unsat core size     : 0
% 0.11/0.42  %    Propositional preprocessing time  : 0.000
% 0.11/0.42  %    Propositional encoding time       : 0.000
% 0.11/0.42  %    Propositional solver time         : 0.000
% 0.11/0.42  %    Success case prop preproc time    : 0.000
% 0.11/0.42  %    Success case prop encoding time   : 0.000
% 0.11/0.42  %    Success case prop solver time     : 0.000
% 0.11/0.42  % Current number of processed clauses  : 4
% 0.11/0.42  %    Positive orientable unit clauses  : 2
% 0.11/0.42  %    Positive unorientable unit clauses: 0
% 0.11/0.42  %    Negative unit clauses             : 1
% 0.11/0.42  %    Non-unit-clauses                  : 1
% 0.11/0.42  % Current number of unprocessed clauses: 0
% 0.11/0.42  % ...number of literals in the above   : 0
% 0.11/0.42  % Current number of archived formulas  : 0
% 0.11/0.42  % Current number of archived clauses   : 0
% 0.11/0.42  % Clause-clause subsumption calls (NU) : 0
% 0.11/0.42  % Rec. Clause-clause subsumption calls : 0
% 0.11/0.42  % Non-unit clause-clause subsumptions  : 0
% 0.11/0.42  % Unit Clause-clause subsumption calls : 1
% 0.11/0.42  % Rewrite failures with RHS unbound    : 0
% 0.11/0.42  % BW rewrite match attempts            : 0
% 0.11/0.42  % BW rewrite match successes           : 0
% 0.11/0.42  % Condensation attempts                : 0
% 0.11/0.42  % Condensation successes               : 0
% 0.11/0.42  % Termbank termtop insertions          : 101
% 0.11/0.42  % Search garbage collected termcells   : 5
% 0.11/0.42  
% 0.11/0.42  % -------------------------------------------------
% 0.11/0.42  % User time                : 0.002 s
% 0.11/0.42  % System time              : 0.002 s
% 0.11/0.42  % Total time               : 0.004 s
% 0.11/0.42  % Maximum resident set size: 3628 pages
% 0.11/0.42  
% 0.11/0.42  % -------------------------------------------------
% 0.11/0.42  % User time                : 0.004 s
% 0.11/0.42  % System time              : 0.011 s
% 0.11/0.42  % Total time               : 0.015 s
% 0.11/0.42  % Maximum resident set size: 4864 pages
% 0.11/0.42  % E exiting
%------------------------------------------------------------------------------