TSTP Solution File: SWV307-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV307-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:34:14 EDT 2024
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 11 unt; 0 nHn; 20 RR)
% Number of literals : 29 ( 2 equ; 13 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-2 aty)
% Number of variables : 24 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Message_Oparts_OBody__dest_0,axiom,
( c_in(X2,c_Message_Oparts(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Oparts(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV006-2.ax',cls_Message_Oparts_OBody__dest_0) ).
cnf(cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0,axiom,
( c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV006-0.ax',cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0) ).
cnf(cls_conjecture_4,negated_conjecture,
c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(c_Message_Omsg_ONonce(v_NB),c_Event_Oused(v_evs2),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Public_OMPair__used_1,axiom,
( c_in(X1,c_Event_Oused(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Event_Oused(X3),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV006-2.ax',cls_Public_OMPair__used_1) ).
cnf(cls_conjecture_6,negated_conjecture,
v_NA = c_Message_Omsg_ONonce(v_NB),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(c_0_6,plain,
( c_in(X2,c_Message_Oparts(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Oparts(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts_OBody__dest_0]) ).
cnf(c_0_7,plain,
( c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0]) ).
cnf(c_0_8,plain,
( c_in(X2,c_Message_Oparts(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OCrypt(X1,X2),c_Message_Oparts(X3),tc_Message_Omsg) ),
c_0_6 ).
cnf(c_0_9,negated_conjecture,
c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg),
cls_conjecture_4 ).
cnf(c_0_10,negated_conjecture,
~ c_in(c_Message_Omsg_ONonce(v_NB),c_Event_Oused(v_evs2),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_11,plain,
( c_in(X1,c_Event_Oused(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Event_Oused(X3),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Public_OMPair__used_1]) ).
cnf(c_0_12,plain,
( c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)
| ~ c_in(X1,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X2)),tc_Message_Omsg) ),
c_0_7 ).
cnf(c_0_13,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
~ c_in(c_Message_Omsg_ONonce(v_NB),c_Event_Oused(v_evs2),tc_Message_Omsg),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
v_NA = c_Message_Omsg_ONonce(v_NB),
cls_conjecture_6 ).
cnf(c_0_16,plain,
( c_in(X1,c_Event_Oused(X3),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(X1,X2),c_Event_Oused(X3),tc_Message_Omsg) ),
c_0_11 ).
cnf(c_0_17,negated_conjecture,
c_in(c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B))),c_Event_Oused(v_evs2),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ c_in(v_NA,c_Event_Oused(v_evs2),tc_Message_Omsg),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV307-1 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 06:53:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.54 # Version: 3.1.0
% 0.20/0.54 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # new_bool_3 with pid 24034 completed with status 0
% 0.20/0.54 # Result found by new_bool_3
% 0.20/0.54 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54 # Search class: FGHSM-FFLM31-MFFFFFNN
% 0.20/0.54 # Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.20/0.54 # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 24037 completed with status 0
% 0.20/0.54 # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.20/0.54 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54 # Search class: FGHSM-FFLM31-MFFFFFNN
% 0.20/0.54 # Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.20/0.54 # Preprocessing time : 0.004 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Unsatisfiable
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 1481
% 0.20/0.54 # Removed by relevancy pruning/SinE : 1328
% 0.20/0.54 # Initial clauses : 153
% 0.20/0.54 # Removed in clause preprocessing : 0
% 0.20/0.54 # Initial clauses in saturation : 153
% 0.20/0.54 # Processed clauses : 284
% 0.20/0.54 # ...of these trivial : 1
% 0.20/0.54 # ...subsumed : 24
% 0.20/0.54 # ...remaining for further processing : 259
% 0.20/0.54 # Other redundant clauses eliminated : 0
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 0
% 0.20/0.54 # Backward-rewritten : 2
% 0.20/0.54 # Generated clauses : 108
% 0.20/0.54 # ...of the previous two non-redundant : 54
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 0
% 0.20/0.54 # Paramodulations : 87
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 21
% 0.20/0.54 # Disequality decompositions : 0
% 0.20/0.54 # Total rewrite steps : 28
% 0.20/0.54 # ...of those cached : 7
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 126
% 0.20/0.54 # Positive orientable unit clauses : 45
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 23
% 0.20/0.54 # Non-unit-clauses : 58
% 0.20/0.54 # Current number of unprocessed clauses: 54
% 0.20/0.54 # ...number of literals in the above : 115
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 133
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 3544
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 3226
% 0.20/0.54 # Non-unit clause-clause subsumptions : 11
% 0.20/0.54 # Unit Clause-clause subsumption calls : 322
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 28
% 0.20/0.54 # BW rewrite match successes : 2
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 12966
% 0.20/0.54 # Search garbage collected termcells : 2855
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.018 s
% 0.20/0.54 # System time : 0.008 s
% 0.20/0.54 # Total time : 0.026 s
% 0.20/0.54 # Maximum resident set size: 3052 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.041 s
% 0.20/0.54 # System time : 0.010 s
% 0.20/0.54 # Total time : 0.051 s
% 0.20/0.54 # Maximum resident set size: 2500 pages
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------