↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 4.66s 1.12s
% Output   : CNFRefutation 4.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   43 (  24 unt;   8 nHn;  23 RR)
%            Number of literals    :   69 (  42 equ;  33 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   :   93 (  57 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/sandbox2/benchmark/theBenchmark.p',cls_keymode_Oinduct_0) ).

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

cnf(cls_insert__commute_0,axiom,
    c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__commute_0) ).

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

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

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

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

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

cnf(cls_msg_Osimps_I10_J_0,axiom,
    c_Message_Omsg_OAgent(X1) != c_Message_Omsg_ONonce(X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_msg_Osimps_I10_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/sandbox2/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(X1,c_Public_Okeymode_OSignature))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
    | hBOOL(hAPP(X1,X2)) ),
    c_0_10 ).

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

cnf(c_0_13,axiom,
    c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
    cls_insert__commute_0 ).

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(c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),c_Public_Okeymode_OEncryption))
    | hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),X3)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    hBOOL(hAPP(c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4),X2)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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(c_Set_Oinsert(c_Public_Okeymode_OEncryption,c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),X2),X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13]) ).

cnf(c_0_19,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_20,plain,
    ( hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X2,X3),X1))
    | X1 = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,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_22,plain,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    c_0_19 ).

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

cnf(c_0_24,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_25,plain,
    c_Message_Omsg_OHash(X1) != c_Message_Omsg_ONonce(X2),
    c_0_21 ).

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

cnf(c_0_27,plain,
    c_Message_Omsg_OHash(X1) != c_Message_Omsg_OAgent(X2),
    c_0_24 ).

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

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

cnf(c_0_30,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_25,c_0_26]) ).

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_27,c_0_26]) ).

cnf(c_0_32,plain,
    c_Message_Oagent_OSpy != c_Message_Oagent_OFriend(X1),
    c_0_28 ).

cnf(c_0_33,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_34,plain,
    c_Message_Omsg_OAgent(X1) != c_Message_Omsg_ONonce(X2),
    c_0_29 ).

cnf(c_0_35,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_30,c_0_26]) ).

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_26]) ).

cnf(c_0_37,plain,
    ( c_Public_Okeymode_OSignature != c_Message_Oagent_OSpy
    | c_Message_Oagent_OFriend(X1) = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_32,c_0_26]) ).

cnf(c_0_38,plain,
    ( c_Message_Omsg_OHash(X1) != c_Message_Omsg_OHash(X2)
    | X1 = X2 ),
    c_0_33 ).

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

cnf(c_0_40,plain,
    ( c_Public_Okeymode_OSignature != c_Message_Oagent_OSpy
    | c_Public_Okeymode_OEncryption != c_Message_Oagent_OSpy ),
    inference(spm,[status(thm)],[c_0_32,c_0_37]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV765-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n012.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 09:24:06 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  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
% 4.66/1.12  % Version: 3.5.1
% 4.66/1.12  % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.66/1.12  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.66/1.12  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.66/1.12  % Starting new_bool_3 with 300s (1) cores
% 4.66/1.12  % Starting new_bool_1 with 300s (1) cores
% 4.66/1.12  % Starting sh5l with 300s (1) cores
% 4.66/1.12  % sh5l with pid 2071582 completed with status 0
% 4.66/1.12  % Result found by sh5l
% 4.66/1.12  % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.66/1.12  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.66/1.12  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.66/1.12  % Starting new_bool_3 with 300s (1) cores
% 4.66/1.12  % Starting new_bool_1 with 300s (1) cores
% 4.66/1.12  % Starting sh5l with 300s (1) cores
% 4.66/1.12  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 4.66/1.12  % SinE strategy is gf500_gu_R04_F100_L20000
% 4.66/1.12  % Search class: FGHSM-FSLM31-DFFFFFNN
% 4.66/1.12  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 4.66/1.12  % Starting SubtermCWHack with 28s (1) cores
% 4.66/1.12  % SubtermCWHack with pid 2071588 completed with status 0
% 4.66/1.12  % Result found by SubtermCWHack
% 4.66/1.12  % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.66/1.12  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.66/1.12  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.66/1.12  % Starting new_bool_3 with 300s (1) cores
% 4.66/1.12  % Starting new_bool_1 with 300s (1) cores
% 4.66/1.12  % Starting sh5l with 300s (1) cores
% 4.66/1.12  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 4.66/1.12  % SinE strategy is gf500_gu_R04_F100_L20000
% 4.66/1.12  % Search class: FGHSM-FSLM31-DFFFFFNN
% 4.66/1.12  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 4.66/1.12  % Starting SubtermCWHack with 28s (1) cores
% 4.66/1.12  % Preprocessing time       : 0.006 s
% 4.66/1.12  
% 4.66/1.12  % Proof found!
% 4.66/1.12  % SZS status Unsatisfiable
% 4.66/1.12  % SZS output start CNFRefutation
% See solution above
% 4.66/1.12  % Parsed axioms                        : 545
% 4.66/1.12  % Removed by relevancy pruning/SinE    : 28
% 4.66/1.12  % Initial clauses                      : 517
% 4.66/1.12  % Removed in clause preprocessing      : 0
% 4.66/1.12  % Initial clauses in saturation        : 517
% 4.66/1.12  % Processed clauses                    : 4492
% 4.66/1.12  % ...of these trivial                  : 965
% 4.66/1.12  % ...subsumed                          : 1884
% 4.66/1.12  % ...remaining for further processing  : 1643
% 4.66/1.12  % Other redundant clauses eliminated   : 89
% 4.66/1.12  % Clauses deleted for lack of memory   : 0
% 4.66/1.12  % Backward-subsumed                    : 348
% 4.66/1.12  % Backward-rewritten                   : 188
% 4.66/1.12  % Generated clauses                    : 55830
% 4.66/1.12  % ...of the previous two non-redundant : 32178
% 4.66/1.12  % ...aggressively subsumed             : 0
% 4.66/1.12  % Contextual simplify-reflections      : 1
% 4.66/1.12  % Paramodulations                      : 55640
% 4.66/1.12  % Factorizations                       : 9
% 4.66/1.12  % NegExts                              : 0
% 4.66/1.12  % Equation resolutions                 : 117
% 4.66/1.12  % Disequality decompositions           : 0
% 4.66/1.12  % Total rewrite steps                  : 33458
% 4.66/1.12  % ...of those cached                   : 28234
% 4.66/1.12  % Propositional unsat checks           : 0
% 4.66/1.12  %    Propositional check models        : 0
% 4.66/1.12  %    Propositional check unsatisfiable : 0
% 4.66/1.12  %    Propositional clauses             : 0
% 4.66/1.12  %    Propositional clauses after purity: 0
% 4.66/1.12  %    Propositional unsat core size     : 0
% 4.66/1.12  %    Propositional preprocessing time  : 0.000
% 4.66/1.12  %    Propositional encoding time       : 0.000
% 4.66/1.12  %    Propositional solver time         : 0.000
% 4.66/1.12  %    Success case prop preproc time    : 0.000
% 4.66/1.12  %    Success case prop encoding time   : 0.000
% 4.66/1.12  %    Success case prop solver time     : 0.000
% 4.66/1.12  % Current number of processed clauses  : 1043
% 4.66/1.12  %    Positive orientable unit clauses  : 609
% 4.66/1.12  %    Positive unorientable unit clauses: 1
% 4.66/1.12  %    Negative unit clauses             : 34
% 4.66/1.12  %    Non-unit-clauses                  : 399
% 4.66/1.12  % Current number of unprocessed clauses: 27969
% 4.66/1.12  % ...number of literals in the above   : 54235
% 4.66/1.12  % Current number of archived formulas  : 0
% 4.66/1.12  % Current number of archived clauses   : 600
% 4.66/1.12  % Clause-clause subsumption calls (NU) : 86575
% 4.66/1.12  % Rec. Clause-clause subsumption calls : 58485
% 4.66/1.12  % Non-unit clause-clause subsumptions  : 1670
% 4.66/1.12  % Unit Clause-clause subsumption calls : 6117
% 4.66/1.12  % Rewrite failures with RHS unbound    : 2885
% 4.66/1.12  % BW rewrite match attempts            : 19157
% 4.66/1.12  % BW rewrite match successes           : 3005
% 4.66/1.12  % Condensation attempts                : 0
% 4.66/1.12  % Condensation successes               : 0
% 4.66/1.12  % Termbank termtop insertions          : 735376
% 4.66/1.12  % Search garbage collected termcells   : 1135
% 4.66/1.12  
% 4.66/1.12  % -------------------------------------------------
% 4.66/1.12  % User time                : 0.617 s
% 4.66/1.12  % System time              : 0.027 s
% 4.66/1.12  % Total time               : 0.644 s
% 4.66/1.12  % Maximum resident set size: 4620 pages
% 4.66/1.12  
% 4.66/1.12  % -------------------------------------------------
% 4.66/1.12  % User time                : 0.632 s
% 4.66/1.12  % System time              : 0.032 s
% 4.66/1.12  % Total time               : 0.665 s
% 4.66/1.12  % Maximum resident set size: 5376 pages
% 4.66/1.12  % E exiting
%------------------------------------------------------------------------------