TSTP Solution File: SWV722-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV722-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 05:42:09 EDT 2024
% Result : Unsatisfiable 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 14 unt; 0 nHn; 32 RR)
% Number of literals : 62 ( 2 equ; 27 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-3 aty)
% Number of variables : 75 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_mem__def_0,axiom,
( hBOOL(hAPP(X1,X2))
| ~ c_in(X2,X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).
cnf(cls_mem__def_1,axiom,
( c_in(X1,X2,X3)
| ~ hBOOL(hAPP(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_A,c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_B,c_Message_Omsg_OMPair(v_K,v_X))))),c_List_Oset(v_evs,tc_Event_Oevent),tc_Event_Oevent),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_parts_OBody_0,axiom,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X3,X1),c_Message_Oparts(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_parts_OBody_0) ).
cnf(cls_parts_OInj_0,axiom,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_parts_OInj_0) ).
cnf(cls_Says__imp__spies_0,axiom,
( c_in(X1,c_Event_Oknows(c_Message_Oagent_OSpy,X2),tc_Message_Omsg)
| ~ c_in(c_Event_Oevent_OSays(X3,X4,X1),c_List_Oset(X2,tc_Event_Oevent),tc_Event_Oevent) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Says__imp__spies_0) ).
cnf(cls_parts_OSnd_0,axiom,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X3,X1),c_Message_Oparts(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_parts_OSnd_0) ).
cnf(cls_parts_OFst_0,axiom,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X3),c_Message_Oparts(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_parts_OFst_0) ).
cnf(cls_parts__idem_0,axiom,
c_Message_Oparts(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_parts__idem_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(v_K,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs)),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_10,plain,
( hBOOL(hAPP(X1,X2))
| ~ c_in(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).
cnf(c_0_11,plain,
( c_in(X1,X2,X3)
| ~ hBOOL(hAPP(X2,X1)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_12,plain,
( hBOOL(hAPP(X1,X2))
| ~ c_in(X2,X1,X3) ),
c_0_10 ).
cnf(c_0_13,negated_conjecture,
c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_A,c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_B,c_Message_Omsg_OMPair(v_K,v_X))))),c_List_Oset(v_evs,tc_Event_Oevent),tc_Event_Oevent),
cls_conjecture_0 ).
cnf(c_0_14,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X3,X1),c_Message_Oparts(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_parts_OBody_0]) ).
cnf(c_0_15,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_parts_OInj_0]) ).
cnf(c_0_16,plain,
( c_in(X1,c_Event_Oknows(c_Message_Oagent_OSpy,X2),tc_Message_Omsg)
| ~ c_in(c_Event_Oevent_OSays(X3,X4,X1),c_List_Oset(X2,tc_Event_Oevent),tc_Event_Oevent) ),
inference(fof_simplification,[status(thm)],[cls_Says__imp__spies_0]) ).
cnf(c_0_17,plain,
( c_in(X1,X2,X3)
| ~ hBOOL(hAPP(X2,X1)) ),
c_0_11 ).
cnf(c_0_18,negated_conjecture,
hBOOL(hAPP(c_List_Oset(v_evs,tc_Event_Oevent),c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_A,c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_B,c_Message_Omsg_OMPair(v_K,v_X))))))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X3,X1),c_Message_Oparts(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_parts_OSnd_0]) ).
cnf(c_0_20,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X3,X1),c_Message_Oparts(X2),tc_Message_Omsg) ),
c_0_14 ).
cnf(c_0_21,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(X1,X2,tc_Message_Omsg) ),
c_0_15 ).
cnf(c_0_22,plain,
( c_in(X1,c_Event_Oknows(c_Message_Oagent_OSpy,X2),tc_Message_Omsg)
| ~ c_in(c_Event_Oevent_OSays(X3,X4,X1),c_List_Oset(X2,tc_Event_Oevent),tc_Event_Oevent) ),
c_0_16 ).
cnf(c_0_23,negated_conjecture,
c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_A,c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_B,c_Message_Omsg_OMPair(v_K,v_X))))),c_List_Oset(v_evs,tc_Event_Oevent),X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X3,X1),c_Message_Oparts(X2),tc_Message_Omsg) ),
c_0_19 ).
cnf(c_0_25,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X3,X1),X2,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_B,c_Message_Omsg_OMPair(v_K,v_X)))),c_Event_Oknows(c_Message_Oagent_OSpy,v_evs),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X3),c_Message_Oparts(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_parts_OFst_0]) ).
cnf(c_0_28,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X3,X1),X2,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_B,c_Message_Omsg_OMPair(v_K,v_X))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,axiom,
c_Message_Oparts(c_Message_Oparts(X1)) = c_Message_Oparts(X1),
cls_parts__idem_0 ).
cnf(c_0_31,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X3),c_Message_Oparts(X2),tc_Message_Omsg) ),
c_0_27 ).
cnf(c_0_32,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_B,c_Message_Omsg_OMPair(v_K,v_X)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs)),tc_Message_Omsg),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ c_in(v_K,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs)),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_34,plain,
( c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X3),X2,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_35,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_K,v_X),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs)),tc_Message_Omsg),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_32]),c_0_30]) ).
cnf(c_0_36,negated_conjecture,
~ c_in(v_K,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs)),tc_Message_Omsg),
c_0_33 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV722-1 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 08:00:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.59 # Version: 3.1.0
% 0.20/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.59 # Starting sh5l with 300s (1) cores
% 0.20/0.59 # new_bool_3 with pid 6829 completed with status 0
% 0.20/0.59 # Result found by new_bool_3
% 0.20/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.59 # Search class: FGHSM-FSLS31-DFFFFFNN
% 0.20/0.59 # partial match(1): FGHSM-FSLM31-DFFFFFNN
% 0.20/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.59 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.59 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 6833 completed with status 0
% 0.20/0.59 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.59 # Search class: FGHSM-FSLS31-DFFFFFNN
% 0.20/0.59 # partial match(1): FGHSM-FSLM31-DFFFFFNN
% 0.20/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.59 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.59 # Preprocessing time : 0.005 s
% 0.20/0.59 # Presaturation interreduction done
% 0.20/0.59
% 0.20/0.59 # Proof found!
% 0.20/0.59 # SZS status Unsatisfiable
% 0.20/0.59 # SZS output start CNFRefutation
% See solution above
% 0.20/0.59 # Parsed axioms : 519
% 0.20/0.59 # Removed by relevancy pruning/SinE : 232
% 0.20/0.59 # Initial clauses : 287
% 0.20/0.59 # Removed in clause preprocessing : 0
% 0.20/0.59 # Initial clauses in saturation : 287
% 0.20/0.59 # Processed clauses : 522
% 0.20/0.59 # ...of these trivial : 46
% 0.20/0.59 # ...subsumed : 78
% 0.20/0.59 # ...remaining for further processing : 398
% 0.20/0.59 # Other redundant clauses eliminated : 8
% 0.20/0.59 # Clauses deleted for lack of memory : 0
% 0.20/0.59 # Backward-subsumed : 0
% 0.20/0.59 # Backward-rewritten : 9
% 0.20/0.59 # Generated clauses : 611
% 0.20/0.59 # ...of the previous two non-redundant : 430
% 0.20/0.59 # ...aggressively subsumed : 0
% 0.20/0.59 # Contextual simplify-reflections : 0
% 0.20/0.59 # Paramodulations : 583
% 0.20/0.59 # Factorizations : 0
% 0.20/0.59 # NegExts : 0
% 0.20/0.59 # Equation resolutions : 28
% 0.20/0.59 # Disequality decompositions : 0
% 0.20/0.59 # Total rewrite steps : 254
% 0.20/0.59 # ...of those cached : 122
% 0.20/0.59 # Propositional unsat checks : 0
% 0.20/0.59 # Propositional check models : 0
% 0.20/0.59 # Propositional check unsatisfiable : 0
% 0.20/0.59 # Propositional clauses : 0
% 0.20/0.59 # Propositional clauses after purity: 0
% 0.20/0.59 # Propositional unsat core size : 0
% 0.20/0.59 # Propositional preprocessing time : 0.000
% 0.20/0.59 # Propositional encoding time : 0.000
% 0.20/0.59 # Propositional solver time : 0.000
% 0.20/0.59 # Success case prop preproc time : 0.000
% 0.20/0.59 # Success case prop encoding time : 0.000
% 0.20/0.59 # Success case prop solver time : 0.000
% 0.20/0.59 # Current number of processed clauses : 173
% 0.20/0.59 # Positive orientable unit clauses : 67
% 0.20/0.59 # Positive unorientable unit clauses: 0
% 0.20/0.59 # Negative unit clauses : 18
% 0.20/0.59 # Non-unit-clauses : 88
% 0.20/0.59 # Current number of unprocessed clauses: 408
% 0.20/0.59 # ...number of literals in the above : 757
% 0.20/0.59 # Current number of archived formulas : 0
% 0.20/0.59 # Current number of archived clauses : 225
% 0.20/0.59 # Clause-clause subsumption calls (NU) : 7015
% 0.20/0.59 # Rec. Clause-clause subsumption calls : 6679
% 0.20/0.59 # Non-unit clause-clause subsumptions : 45
% 0.20/0.59 # Unit Clause-clause subsumption calls : 197
% 0.20/0.59 # Rewrite failures with RHS unbound : 0
% 0.20/0.59 # BW rewrite match attempts : 47
% 0.20/0.59 # BW rewrite match successes : 35
% 0.20/0.59 # Condensation attempts : 0
% 0.20/0.59 # Condensation successes : 0
% 0.20/0.59 # Termbank termtop insertions : 20058
% 0.20/0.59 # Search garbage collected termcells : 1424
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.039 s
% 0.20/0.59 # System time : 0.008 s
% 0.20/0.59 # Total time : 0.047 s
% 0.20/0.59 # Maximum resident set size: 2528 pages
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.052 s
% 0.20/0.59 # System time : 0.011 s
% 0.20/0.59 # Total time : 0.063 s
% 0.20/0.59 # Maximum resident set size: 2088 pages
% 0.20/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------