↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n015.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:51 PM UTC 2026

% Result   : Unsatisfiable 4.32s 6.25s
% Output   : CNFRefutation 4.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   44 (  20 unt;   9 nHn;  23 RR)
%            Number of literals    :   77 (  41 equ;  39 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-3 aty)
%            Number of variables   :   96 (  61 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_keymode_Oinduct_0,axiom,
    ( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_keymode_Oinduct_0) ).

cnf(cls_insert__code_2,axiom,
    ( ~ hBOOL(hAPP(X2,X4))
    | hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_2) ).

cnf(cls_insert__code_0,axiom,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
    | X3 = X2
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_0) ).

cnf(cls_insert__code_1,axiom,
    hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_1) ).

cnf(cls_bot1E_0,axiom,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_bot1E_0) ).

cnf(cls_msg_Osimps_I15_J_0,axiom,
    c_Message_Omsg_OHash(X1) != c_Message_Omsg_OAgent(X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_msg_Osimps_I15_J_0) ).

cnf(cls_msg_Osimps_I33_J_0,axiom,
    c_Message_Omsg_OHash(X1) != c_Message_Omsg_ONonce(X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_msg_Osimps_I33_J_0) ).

cnf(cls_agent_Osimps_I7_J_0,axiom,
    c_Message_Oagent_OSpy != c_Message_Oagent_OFriend(X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_agent_Osimps_I7_J_0) ).

cnf(cls_msg_Osimps_I11_J_0,axiom,
    c_Message_Omsg_ONonce(X1) != c_Message_Omsg_OAgent(X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_msg_Osimps_I11_J_0) ).

cnf(cls_msg_Osimps_I5_J_0,axiom,
    ( c_Message_Omsg_OHash(X1) != c_Message_Omsg_OHash(X2)
    | X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_msg_Osimps_I5_J_0) ).

cnf(c_0_10,plain,
    ( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_keymode_Oinduct_0]) ).

cnf(c_0_11,plain,
    ( ~ hBOOL(hAPP(X2,X4))
    | hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4)) ),
    inference(fof_simplification,[status(thm)],[cls_insert__code_2]) ).

cnf(c_0_12,plain,
    ( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
    | hBOOL(hAPP(X1,X2)) ),
    c_0_10 ).

cnf(c_0_13,plain,
    ( ~ hBOOL(hAPP(X2,X4))
    | hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4)) ),
    c_0_11 ).

cnf(c_0_14,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
    | X3 = X2
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_insert__code_0]) ).

cnf(c_0_15,plain,
    ( ~ hBOOL(hAPP(X2,c_Public_Okeymode_OSignature))
    | ~ hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),c_Public_Okeymode_OEncryption))
    | hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,axiom,
    hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
    cls_insert__code_1 ).

cnf(c_0_17,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
    | X3 = X2
    | hBOOL(hAPP(X1,X2)) ),
    c_0_14 ).

cnf(c_0_18,plain,
    ( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
    | hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OEncryption,X1,X2),X3)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( ~ hBOOL(hAPP(X2,c_Public_Okeymode_OSignature))
    | hBOOL(hAPP(X2,X1))
    | X1 = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,plain,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    inference(fof_simplification,[status(thm)],[cls_bot1E_0]) ).

cnf(c_0_21,plain,
    ( hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X2,X3),X1))
    | X1 = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_22,plain,
    c_Message_Omsg_OHash(X1) != c_Message_Omsg_OAgent(X2),
    inference(fof_simplification,[status(thm)],[cls_msg_Osimps_I15_J_0]) ).

cnf(c_0_23,plain,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    c_0_20 ).

cnf(c_0_24,plain,
    ( hBOOL(hAPP(X2,X1))
    | X1 = c_Public_Okeymode_OSignature
    | X1 = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_17,c_0_21]) ).

cnf(c_0_25,plain,
    c_Message_Omsg_OHash(X1) != c_Message_Omsg_ONonce(X2),
    inference(fof_simplification,[status(thm)],[cls_msg_Osimps_I33_J_0]) ).

cnf(c_0_26,plain,
    c_Message_Omsg_OHash(X1) != c_Message_Omsg_OAgent(X2),
    c_0_22 ).

cnf(c_0_27,plain,
    ( X1 = c_Public_Okeymode_OEncryption
    | X1 = c_Public_Okeymode_OSignature ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,plain,
    c_Message_Omsg_OHash(X1) != c_Message_Omsg_ONonce(X2),
    c_0_25 ).

cnf(c_0_29,plain,
    c_Message_Oagent_OSpy != c_Message_Oagent_OFriend(X1),
    inference(fof_simplification,[status(thm)],[cls_agent_Osimps_I7_J_0]) ).

cnf(c_0_30,plain,
    c_Message_Omsg_ONonce(X1) != c_Message_Omsg_OAgent(X2),
    inference(fof_simplification,[status(thm)],[cls_msg_Osimps_I11_J_0]) ).

cnf(c_0_31,plain,
    ( c_Message_Omsg_OHash(X2) != c_Public_Okeymode_OSignature
    | c_Message_Omsg_OAgent(X1) = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_32,plain,
    ( c_Message_Omsg_OHash(X2) != c_Public_Okeymode_OSignature
    | c_Message_Omsg_ONonce(X1) = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_28,c_0_27]) ).

cnf(c_0_33,plain,
    c_Message_Oagent_OSpy != c_Message_Oagent_OFriend(X1),
    c_0_29 ).

cnf(c_0_34,plain,
    ( c_Message_Omsg_OHash(X1) != c_Message_Omsg_OHash(X2)
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[cls_msg_Osimps_I5_J_0]) ).

cnf(c_0_35,plain,
    c_Message_Omsg_ONonce(X1) != c_Message_Omsg_OAgent(X2),
    c_0_30 ).

cnf(c_0_36,plain,
    ( c_Message_Omsg_OAgent(X2) = c_Public_Okeymode_OEncryption
    | c_Message_Omsg_OHash(X1) = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_31,c_0_27]) ).

cnf(c_0_37,plain,
    ( c_Message_Omsg_ONonce(X2) = c_Public_Okeymode_OEncryption
    | c_Message_Omsg_OHash(X1) = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_32,c_0_27]) ).

cnf(c_0_38,plain,
    ( c_Public_Okeymode_OSignature != c_Message_Oagent_OSpy
    | c_Message_Oagent_OFriend(X1) = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_33,c_0_27]) ).

cnf(c_0_39,plain,
    ( c_Message_Omsg_OHash(X1) != c_Message_Omsg_OHash(X2)
    | X1 = X2 ),
    c_0_34 ).

cnf(c_0_40,plain,
    c_Message_Omsg_OHash(X1) = c_Public_Okeymode_OEncryption,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).

cnf(c_0_41,plain,
    ( c_Public_Okeymode_OSignature != c_Message_Oagent_OSpy
    | c_Public_Okeymode_OEncryption != c_Message_Oagent_OSpy ),
    inference(spm,[status(thm)],[c_0_33,c_0_38]) ).

cnf(c_0_42,plain,
    X1 = X2,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_40])]) ).

cnf(c_0_43,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_41,c_0_42]),c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV743-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/5.47  % Computer : n015.cluster.edu
% 0.21/5.47  % Model    : x86_64 x86_64
% 0.21/5.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/5.47  % Memory   : 8046.5625MB
% 0.21/5.47  % OS       : Linux 6.8.0-71-generic
% 0.21/5.47  % CPULimit : 300
% 0.21/5.47  % WCLimit  : 300
% 0.21/5.47  % DateTime : Mon Sep 21 09:26:12 UTC 2026
% 0.21/5.47  % CPUTime  : 
% 0.21/5.47  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/5.53  Running first-order theorem proving
% 0.24/5.53  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
% 4.32/6.25  % Version: 3.5.1
% 4.32/6.25  % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.32/6.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.32/6.25  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.32/6.25  % Starting new_bool_3 with 300s (1) cores
% 4.32/6.25  % Starting new_bool_1 with 300s (1) cores
% 4.32/6.25  % Starting sh5l with 300s (1) cores
% 4.32/6.25  % sh5l with pid 1131500 completed with status 0
% 4.32/6.25  % Result found by sh5l
% 4.32/6.25  % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.32/6.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.32/6.25  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.32/6.25  % Starting new_bool_3 with 300s (1) cores
% 4.32/6.25  % Starting new_bool_1 with 300s (1) cores
% 4.32/6.25  % Starting sh5l with 300s (1) cores
% 4.32/6.25  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 4.32/6.25  % SinE strategy is gf500_gu_R04_F100_L20000
% 4.32/6.25  % Search class: FGHSM-FSLM31-DFFFFFNN
% 4.32/6.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 4.32/6.25  % Starting SubtermCWHack with 28s (1) cores
% 4.32/6.25  % SubtermCWHack with pid 1131501 completed with status 0
% 4.32/6.25  % Result found by SubtermCWHack
% 4.32/6.25  % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.32/6.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.32/6.25  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.32/6.25  % Starting new_bool_3 with 300s (1) cores
% 4.32/6.25  % Starting new_bool_1 with 300s (1) cores
% 4.32/6.25  % Starting sh5l with 300s (1) cores
% 4.32/6.25  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 4.32/6.25  % SinE strategy is gf500_gu_R04_F100_L20000
% 4.32/6.25  % Search class: FGHSM-FSLM31-DFFFFFNN
% 4.32/6.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 4.32/6.25  % Starting SubtermCWHack with 28s (1) cores
% 4.32/6.25  % Preprocessing time       : 0.008 s
% 4.32/6.25  
% 4.32/6.25  % Proof found!
% 4.32/6.25  % SZS status Unsatisfiable
% 4.32/6.25  % SZS output start CNFRefutation
% See solution above
% 4.32/6.25  % Parsed axioms                        : 605
% 4.32/6.25  % Removed by relevancy pruning/SinE    : 39
% 4.32/6.25  % Initial clauses                      : 566
% 4.32/6.25  % Removed in clause preprocessing      : 0
% 4.32/6.25  % Initial clauses in saturation        : 566
% 4.32/6.25  % Processed clauses                    : 4944
% 4.32/6.25  % ...of these trivial                  : 984
% 4.32/6.25  % ...subsumed                          : 2174
% 4.32/6.25  % ...remaining for further processing  : 1786
% 4.32/6.25  % Other redundant clauses eliminated   : 93
% 4.32/6.25  % Clauses deleted for lack of memory   : 0
% 4.32/6.25  % Backward-subsumed                    : 413
% 4.32/6.25  % Backward-rewritten                   : 196
% 4.32/6.25  % Generated clauses                    : 54923
% 4.32/6.25  % ...of the previous two non-redundant : 31479
% 4.32/6.25  % ...aggressively subsumed             : 0
% 4.32/6.25  % Contextual simplify-reflections      : 1
% 4.32/6.25  % Paramodulations                      : 54690
% 4.32/6.25  % Factorizations                       : 9
% 4.32/6.25  % NegExts                              : 0
% 4.32/6.25  % Equation resolutions                 : 123
% 4.32/6.25  % Disequality decompositions           : 0
% 4.32/6.25  % Total rewrite steps                  : 29924
% 4.32/6.25  % ...of those cached                   : 24560
% 4.32/6.25  % Propositional unsat checks           : 0
% 4.32/6.25  %    Propositional check models        : 0
% 4.32/6.25  %    Propositional check unsatisfiable : 0
% 4.32/6.25  %    Propositional clauses             : 0
% 4.32/6.25  %    Propositional clauses after purity: 0
% 4.32/6.25  %    Propositional unsat core size     : 0
% 4.32/6.25  %    Propositional preprocessing time  : 0.000
% 4.32/6.25  %    Propositional encoding time       : 0.000
% 4.32/6.25  %    Propositional solver time         : 0.000
% 4.32/6.25  %    Success case prop preproc time    : 0.000
% 4.32/6.25  %    Success case prop encoding time   : 0.000
% 4.32/6.25  %    Success case prop solver time     : 0.000
% 4.32/6.25  % Current number of processed clauses  : 1076
% 4.32/6.25  %    Positive orientable unit clauses  : 623
% 4.32/6.25  %    Positive unorientable unit clauses: 1
% 4.32/6.25  %    Negative unit clauses             : 40
% 4.32/6.25  %    Non-unit-clauses                  : 412
% 4.32/6.25  % Current number of unprocessed clauses: 26797
% 4.32/6.25  % ...number of literals in the above   : 53824
% 4.32/6.25  % Current number of archived formulas  : 0
% 4.32/6.25  % Current number of archived clauses   : 710
% 4.32/6.25  % Clause-clause subsumption calls (NU) : 107684
% 4.32/6.25  % Rec. Clause-clause subsumption calls : 68417
% 4.32/6.25  % Non-unit clause-clause subsumptions  : 1467
% 4.32/6.25  % Unit Clause-clause subsumption calls : 8462
% 4.32/6.25  % Rewrite failures with RHS unbound    : 3125
% 4.32/6.25  % BW rewrite match attempts            : 19482
% 4.32/6.25  % BW rewrite match successes           : 3211
% 4.32/6.25  % Condensation attempts                : 0
% 4.32/6.25  % Condensation successes               : 0
% 4.32/6.25  % Termbank termtop insertions          : 723941
% 4.32/6.25  % Search garbage collected termcells   : 1191
% 4.32/6.25  
% 4.32/6.25  % -------------------------------------------------
% 4.32/6.25  % User time                : 0.610 s
% 4.32/6.25  % System time              : 0.038 s
% 4.32/6.25  % Total time               : 0.648 s
% 4.32/6.25  % Maximum resident set size: 4896 pages
% 4.32/6.25  
% 4.32/6.25  % -------------------------------------------------
% 4.32/6.25  % User time                : 0.628 s
% 4.32/6.25  % System time              : 0.043 s
% 4.32/6.25  % Total time               : 0.670 s
% 4.32/6.25  % Maximum resident set size: 5376 pages
% 4.32/6.25  % E exiting
%------------------------------------------------------------------------------