↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n004.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:59:57 PM UTC 2026

% Result   : Unsatisfiable 6.88s 6.47s
% Output   : CNFRefutation 6.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   32 (  22 unt;   0 nHn;  28 RR)
%            Number of literals    :   45 (  10 equ;  17 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   26 (  26 usr;  14 con; 0-5 aty)
%            Number of variables   :   36 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_subset__iff_0,axiom,
    ( ~ c_lessequals(X4,X2,tc_fun(X3,tc_bool))
    | ~ c_in(X1,X4,X3)
    | c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_subset__iff_0) ).

cnf(cls_parts_OBody_0,axiom,
    ( ~ c_in(c_Message_Omsg_OCrypt(X3,X1),c_Message_Oparts(X2),tc_Message_Omsg)
    | c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_parts_OBody_0) ).

cnf(cls_conjecture_11,negated_conjecture,
    c_in(c_Message_Omsg_OCrypt(v_Ka,c_Message_Omsg_ONonce(v_NB)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,c_List_OtakeWhile(c_COMBB(c_Not,c_COMBC(c_fequal(tc_Event_Oevent),c_Event_Oevent_OSays(v_Ba,v_Aa,c_Message_Omsg_OCrypt(v_Ka,c_Message_Omsg_ONonce(v_NB))),tc_Event_Oevent,tc_Event_Oevent,tc_bool),tc_bool,tc_bool,tc_Event_Oevent),c_List_Orev(v_evs4,tc_Event_Oevent),tc_Event_Oevent))),tc_Message_Omsg),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_11) ).

cnf(cls_conjecture_9,negated_conjecture,
    v_K = v_Ka,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_9) ).

cnf(cls_conjecture_10,negated_conjecture,
    v_Nb = v_NB,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_10) ).

cnf(cls_conjecture_7,negated_conjecture,
    v_B = v_Ba,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_7) ).

cnf(cls_conjecture_8,negated_conjecture,
    v_A = v_Aa,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_8) ).

cnf(cls_parts__spies__takeWhile__mono_0,axiom,
    c_lessequals(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,c_List_OtakeWhile(X1,X2,tc_Event_Oevent))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_fun(tc_Message_Omsg,tc_bool)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_parts__spies__takeWhile__mono_0) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_in(c_Message_Omsg_ONonce(v_NB),c_Event_Oused(v_evs4),tc_Message_Omsg),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_usedI_0,axiom,
    ( ~ c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg)
    | c_in(X1,c_Event_Oused(X2),tc_Message_Omsg) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_usedI_0) ).

cnf(cls_spies__evs__rev_0,axiom,
    c_Event_Oknows(c_Message_Oagent_OSpy,X1) = c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Orev(X1,tc_Event_Oevent)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_spies__evs__rev_0) ).

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

cnf(c_0_12,plain,
    ( ~ c_in(c_Message_Omsg_OCrypt(X3,X1),c_Message_Oparts(X2),tc_Message_Omsg)
    | c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_parts_OBody_0]) ).

cnf(c_0_13,negated_conjecture,
    c_in(c_Message_Omsg_OCrypt(v_Ka,c_Message_Omsg_ONonce(v_NB)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,c_List_OtakeWhile(c_COMBB(c_Not,c_COMBC(c_fequal(tc_Event_Oevent),c_Event_Oevent_OSays(v_Ba,v_Aa,c_Message_Omsg_OCrypt(v_Ka,c_Message_Omsg_ONonce(v_NB))),tc_Event_Oevent,tc_Event_Oevent,tc_bool),tc_bool,tc_bool,tc_Event_Oevent),c_List_Orev(v_evs4,tc_Event_Oevent),tc_Event_Oevent))),tc_Message_Omsg),
    cls_conjecture_11 ).

cnf(c_0_14,negated_conjecture,
    v_K = v_Ka,
    cls_conjecture_9 ).

cnf(c_0_15,negated_conjecture,
    v_Nb = v_NB,
    cls_conjecture_10 ).

cnf(c_0_16,negated_conjecture,
    v_B = v_Ba,
    cls_conjecture_7 ).

cnf(c_0_17,negated_conjecture,
    v_A = v_Aa,
    cls_conjecture_8 ).

cnf(c_0_18,plain,
    ( ~ c_lessequals(X4,X2,tc_fun(X3,tc_bool))
    | ~ c_in(X1,X4,X3)
    | c_in(X1,X2,X3) ),
    c_0_11 ).

cnf(c_0_19,axiom,
    c_lessequals(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,c_List_OtakeWhile(X1,X2,tc_Event_Oevent))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_fun(tc_Message_Omsg,tc_bool)),
    cls_parts__spies__takeWhile__mono_0 ).

cnf(c_0_20,plain,
    ( ~ c_in(c_Message_Omsg_OCrypt(X3,X1),c_Message_Oparts(X2),tc_Message_Omsg)
    | c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg) ),
    c_0_12 ).

cnf(c_0_21,negated_conjecture,
    c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_Nb)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,c_List_OtakeWhile(c_COMBB(c_Not,c_COMBC(c_fequal(tc_Event_Oevent),c_Event_Oevent_OSays(v_B,v_A,c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_Nb))),tc_Event_Oevent,tc_Event_Oevent,tc_bool),tc_bool,tc_bool,tc_Event_Oevent),c_List_Orev(v_evs4,tc_Event_Oevent),tc_Event_Oevent))),tc_Message_Omsg),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_14]),c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    ~ c_in(c_Message_Omsg_ONonce(v_NB),c_Event_Oused(v_evs4),tc_Message_Omsg),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

cnf(c_0_23,plain,
    ( ~ c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg)
    | c_in(X1,c_Event_Oused(X2),tc_Message_Omsg) ),
    inference(fof_simplification,[status(thm)],[cls_usedI_0]) ).

cnf(c_0_24,plain,
    ( ~ c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,c_List_OtakeWhile(X3,X2,tc_Event_Oevent))),tc_Message_Omsg)
    | c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    c_in(c_Message_Omsg_ONonce(v_Nb),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,c_List_OtakeWhile(c_COMBB(c_Not,c_COMBC(c_fequal(tc_Event_Oevent),c_Event_Oevent_OSays(v_B,v_A,c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_Nb))),tc_Event_Oevent,tc_Event_Oevent,tc_bool),tc_bool,tc_bool,tc_Event_Oevent),c_List_Orev(v_evs4,tc_Event_Oevent),tc_Event_Oevent))),tc_Message_Omsg),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,axiom,
    c_Event_Oknows(c_Message_Oagent_OSpy,X1) = c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Orev(X1,tc_Event_Oevent)),
    cls_spies__evs__rev_0 ).

cnf(c_0_27,negated_conjecture,
    ~ c_in(c_Message_Omsg_ONonce(v_NB),c_Event_Oused(v_evs4),tc_Message_Omsg),
    c_0_22 ).

cnf(c_0_28,plain,
    ( ~ c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg)
    | c_in(X1,c_Event_Oused(X2),tc_Message_Omsg) ),
    c_0_23 ).

cnf(c_0_29,negated_conjecture,
    c_in(c_Message_Omsg_ONonce(v_Nb),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs4)),tc_Message_Omsg),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    ~ c_in(c_Message_Omsg_ONonce(v_Nb),c_Event_Oused(v_evs4),tc_Message_Omsg),
    inference(rw,[status(thm)],[c_0_27,c_0_15]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWV793-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.45  % Computer : n004.cluster.edu
% 0.17/5.45  % Model    : x86_64 x86_64
% 0.17/5.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.45  % Memory   : 8046.5625MB
% 0.17/5.45  % OS       : Linux 6.8.0-71-generic
% 0.17/5.45  % CPULimit : 300
% 0.17/5.45  % WCLimit  : 300
% 0.17/5.45  % DateTime : Mon Sep 21 09:25:41 UTC 2026
% 0.17/5.45  % CPUTime  : 
% 0.17/5.45  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/5.52  Running first-order theorem proving
% 0.22/5.52  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 6.88/6.47  % Version: 3.5.1
% 6.88/6.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.88/6.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.88/6.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.88/6.47  % Starting new_bool_3 with 300s (1) cores
% 6.88/6.47  % Starting new_bool_1 with 300s (1) cores
% 6.88/6.47  % Starting sh5l with 300s (1) cores
% 6.88/6.47  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2806611 completed with status 0
% 6.88/6.47  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 6.88/6.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.88/6.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.88/6.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.88/6.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.88/6.47  % No SInE strategy applied
% 6.88/6.47  % Search class: FGHSM-FSLM32-DFFFFFNN
% 6.88/6.47  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.88/6.47  % Starting SubtermCWHack with 136s (1) cores
% 6.88/6.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 6.88/6.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 6.88/6.47  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 6.88/6.47  % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 6.88/6.47  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2806616 completed with status 0
% 6.88/6.47  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 6.88/6.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.88/6.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.88/6.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.88/6.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.88/6.47  % No SInE strategy applied
% 6.88/6.47  % Search class: FGHSM-FSLM32-DFFFFFNN
% 6.88/6.47  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.88/6.47  % Starting SubtermCWHack with 136s (1) cores
% 6.88/6.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 6.88/6.47  % Preprocessing time       : 0.014 s
% 6.88/6.47  % Presaturation interreduction done
% 6.88/6.47  
% 6.88/6.47  % Proof found!
% 6.88/6.47  % SZS status Unsatisfiable
% 6.88/6.47  % SZS output start CNFRefutation
% See solution above
% 6.88/6.47  % Parsed axioms                        : 624
% 6.88/6.47  % Removed by relevancy pruning/SinE    : 0
% 6.88/6.47  % Initial clauses                      : 624
% 6.88/6.47  % Removed in clause preprocessing      : 1
% 6.88/6.47  % Initial clauses in saturation        : 623
% 6.88/6.47  % Processed clauses                    : 4000
% 6.88/6.47  % ...of these trivial                  : 163
% 6.88/6.47  % ...subsumed                          : 1883
% 6.88/6.47  % ...remaining for further processing  : 1954
% 6.88/6.47  % Other redundant clauses eliminated   : 58
% 6.88/6.47  % Clauses deleted for lack of memory   : 0
% 6.88/6.47  % Backward-subsumed                    : 172
% 6.88/6.47  % Backward-rewritten                   : 85
% 6.88/6.47  % Generated clauses                    : 18423
% 6.88/6.47  % ...of the previous two non-redundant : 14928
% 6.88/6.47  % ...aggressively subsumed             : 0
% 6.88/6.47  % Contextual simplify-reflections      : 0
% 6.88/6.47  % Paramodulations                      : 18330
% 6.88/6.47  % Factorizations                       : 4
% 6.88/6.47  % NegExts                              : 0
% 6.88/6.47  % Equation resolutions                 : 89
% 6.88/6.47  % Disequality decompositions           : 0
% 6.88/6.47  % Total rewrite steps                  : 9457
% 6.88/6.47  % ...of those cached                   : 7416
% 6.88/6.47  % Propositional unsat checks           : 0
% 6.88/6.47  %    Propositional check models        : 0
% 6.88/6.47  %    Propositional check unsatisfiable : 0
% 6.88/6.47  %    Propositional clauses             : 0
% 6.88/6.47  %    Propositional clauses after purity: 0
% 6.88/6.47  %    Propositional unsat core size     : 0
% 6.88/6.47  %    Propositional preprocessing time  : 0.000
% 6.88/6.47  %    Propositional encoding time       : 0.000
% 6.88/6.47  %    Propositional solver time         : 0.000
% 6.88/6.47  %    Success case prop preproc time    : 0.000
% 6.88/6.47  %    Success case prop encoding time   : 0.000
% 6.88/6.47  %    Success case prop solver time     : 0.000
% 6.88/6.47  % Current number of processed clauses  : 1217
% 6.88/6.47  %    Positive orientable unit clauses  : 492
% 6.88/6.47  %    Positive unorientable unit clauses: 9
% 6.88/6.47  %    Negative unit clauses             : 212
% 6.88/6.47  %    Non-unit-clauses                  : 504
% 6.88/6.47  % Current number of unprocessed clauses: 11725
% 6.88/6.47  % ...number of literals in the above   : 22928
% 6.88/6.47  % Current number of archived formulas  : 0
% 6.88/6.47  % Current number of archived clauses   : 738
% 6.88/6.47  % Clause-clause subsumption calls (NU) : 85790
% 6.88/6.47  % Rec. Clause-clause subsumption calls : 56499
% 6.88/6.47  % Non-unit clause-clause subsumptions  : 698
% 6.88/6.47  % Unit Clause-clause subsumption calls : 30076
% 6.88/6.47  % Rewrite failures with RHS unbound    : 6
% 6.88/6.47  % BW rewrite match attempts            : 1471
% 6.88/6.47  % BW rewrite match successes           : 171
% 6.88/6.47  % Condensation attempts                : 0
% 6.88/6.47  % Condensation successes               : 0
% 6.88/6.47  % Termbank termtop insertions          : 323984
% 6.88/6.47  % Search garbage collected termcells   : 1079
% 6.88/6.47  
% 6.88/6.47  % -------------------------------------------------
% 6.88/6.47  % User time                : 0.764 s
% 6.88/6.47  % System time              : 0.038 s
% 6.88/6.47  % Total time               : 0.802 s
% 6.88/6.47  % Maximum resident set size: 4900 pages
% 6.88/6.47  
% 6.88/6.47  % -------------------------------------------------
% 6.88/6.47  % User time                : 4.090 s
% 6.88/6.47  % System time              : 0.221 s
% 6.88/6.47  % Total time               : 4.311 s
% 6.88/6.47  % Maximum resident set size: 5376 pages
% 6.88/6.47  % E exiting
%------------------------------------------------------------------------------