TSTP Solution File: SWV727-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV727-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:10 EDT 2024
% Result : Unsatisfiable 41.63s 5.68s
% Output : CNFRefutation 41.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 21 unt; 4 nHn; 32 RR)
% Number of literals : 66 ( 5 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 9 con; 0-3 aty)
% Number of variables : 47 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_mem__def_0,axiom,
( hBOOL(hAPP(X1,X2))
| ~ c_in(X2,X1,X3) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_conjecture_5,negated_conjecture,
c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg))),tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_keysFor__parts__insert_0,axiom,
( c_in(hAPP(c_Message_Omsg_OKey,c_Message_OinvKey(X1)),c_Message_Oparts(X2),tc_Message_Omsg)
| c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Lattices_Oupper__semilattice__class_Osup(X3,X2,tc_fun(tc_Message_Omsg,tc_bool)))),tc_nat)
| ~ c_in(X4,c_Message_Osynth(c_Message_Oanalz(X2)),tc_Message_Omsg)
| ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(X4,X3,tc_Message_Omsg))),tc_nat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_keysFor__parts__insert_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_6,negated_conjecture,
( c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg)
| ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_nat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_K,c_Message_OsymKeys,tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_usedI_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/theBenchmark.p',cls_usedI_0) ).
cnf(cls_Un__absorb_0,axiom,
c_Lattices_Oupper__semilattice__class_Osup(X1,X1,tc_fun(X2,tc_bool)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Un__absorb_0) ).
cnf(cls_invKey__K_0,axiom,
( c_Message_OinvKey(X1) = X1
| ~ c_in(X1,c_Message_OsymKeys,tc_nat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_invKey__K_0) ).
cnf(c_0_11,plain,
( hBOOL(hAPP(X1,X2))
| ~ c_in(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).
cnf(c_0_12,plain,
( c_in(X1,X2,X3)
| ~ hBOOL(hAPP(X2,X1)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_13,plain,
( hBOOL(hAPP(X1,X2))
| ~ c_in(X2,X1,X3) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg))),tc_nat),
cls_conjecture_5 ).
cnf(c_0_15,plain,
( c_in(hAPP(c_Message_Omsg_OKey,c_Message_OinvKey(X1)),c_Message_Oparts(X2),tc_Message_Omsg)
| c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Lattices_Oupper__semilattice__class_Osup(X3,X2,tc_fun(tc_Message_Omsg,tc_bool)))),tc_nat)
| ~ c_in(X4,c_Message_Osynth(c_Message_Oanalz(X2)),tc_Message_Omsg)
| ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(X4,X3,tc_Message_Omsg))),tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_keysFor__parts__insert_0]) ).
cnf(c_0_16,plain,
( c_in(X1,X2,X3)
| ~ hBOOL(hAPP(X2,X1)) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
hBOOL(hAPP(c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg))),v_K)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg),
cls_conjecture_2 ).
cnf(c_0_19,negated_conjecture,
( c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg)
| ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).
cnf(c_0_20,negated_conjecture,
~ c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_21,plain,
( c_in(hAPP(c_Message_Omsg_OKey,c_Message_OinvKey(X1)),c_Message_Oparts(X2),tc_Message_Omsg)
| c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Lattices_Oupper__semilattice__class_Osup(X3,X2,tc_fun(tc_Message_Omsg,tc_bool)))),tc_nat)
| ~ c_in(X4,c_Message_Osynth(c_Message_Oanalz(X2)),tc_Message_Omsg)
| ~ c_in(X1,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(X4,X3,tc_Message_Omsg))),tc_nat) ),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Set_Oinsert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg))),X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
hBOOL(hAPP(c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),v_X)),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg)
| ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_nat) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
~ c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Event_Oused(v_evsf),tc_Message_Omsg),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
c_in(v_K,c_Message_OsymKeys,tc_nat),
cls_conjecture_0 ).
cnf(c_0_27,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_usedI_0]) ).
cnf(c_0_28,negated_conjecture,
( c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Lattices_Oupper__semilattice__class_Osup(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),X1,tc_fun(tc_Message_Omsg,tc_bool)))),tc_nat)
| c_in(hAPP(c_Message_Omsg_OKey,c_Message_OinvKey(v_K)),c_Message_Oparts(X1),tc_Message_Omsg)
| ~ c_in(v_X,c_Message_Osynth(c_Message_Oanalz(X1)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),X1),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_30,axiom,
c_Lattices_Oupper__semilattice__class_Osup(X1,X1,tc_fun(X2,tc_bool)) = X1,
cls_Un__absorb_0 ).
cnf(c_0_31,negated_conjecture,
~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_nat),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( c_Message_OinvKey(X1) = X1
| ~ c_in(X1,c_Message_OsymKeys,tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_invKey__K_0]) ).
cnf(c_0_33,negated_conjecture,
hBOOL(hAPP(c_Message_OsymKeys,v_K)),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_34,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_27 ).
cnf(c_0_35,negated_conjecture,
c_in(hAPP(c_Message_Omsg_OKey,c_Message_OinvKey(v_K)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_36,plain,
( c_Message_OinvKey(X1) = X1
| ~ c_in(X1,c_Message_OsymKeys,tc_nat) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
c_in(v_K,c_Message_OsymKeys,X1),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
~ c_in(hAPP(c_Message_Omsg_OKey,v_K),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWV727-1 : TPTP v8.2.0. Released v4.1.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 08:29:07 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.38 Running first-order model finding
% 0.14/0.38 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
% 41.63/5.68 # Version: 3.1.0
% 41.63/5.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 41.63/5.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.63/5.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 41.63/5.68 # Starting new_bool_3 with 300s (1) cores
% 41.63/5.68 # Starting new_bool_1 with 300s (1) cores
% 41.63/5.68 # Starting sh5l with 300s (1) cores
% 41.63/5.68 # new_bool_3 with pid 1505 completed with status 0
% 41.63/5.68 # Result found by new_bool_3
% 41.63/5.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 41.63/5.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.63/5.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 41.63/5.68 # Starting new_bool_3 with 300s (1) cores
% 41.63/5.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 41.63/5.68 # Search class: FGHSM-FSLM31-DFFFFFNN
% 41.63/5.68 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 41.63/5.68 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 41.63/5.68 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1509 completed with status 0
% 41.63/5.68 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 41.63/5.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 41.63/5.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 41.63/5.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 41.63/5.68 # Starting new_bool_3 with 300s (1) cores
% 41.63/5.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 41.63/5.68 # Search class: FGHSM-FSLM31-DFFFFFNN
% 41.63/5.68 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 41.63/5.68 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 41.63/5.68 # Preprocessing time : 0.004 s
% 41.63/5.68 # Presaturation interreduction done
% 41.63/5.68
% 41.63/5.68 # Proof found!
% 41.63/5.68 # SZS status Unsatisfiable
% 41.63/5.68 # SZS output start CNFRefutation
% See solution above
% 41.63/5.68 # Parsed axioms : 493
% 41.63/5.68 # Removed by relevancy pruning/SinE : 80
% 41.63/5.68 # Initial clauses : 413
% 41.63/5.68 # Removed in clause preprocessing : 0
% 41.63/5.68 # Initial clauses in saturation : 413
% 41.63/5.68 # Processed clauses : 29861
% 41.63/5.68 # ...of these trivial : 926
% 41.63/5.68 # ...subsumed : 24086
% 41.63/5.68 # ...remaining for further processing : 4849
% 41.63/5.68 # Other redundant clauses eliminated : 285
% 41.63/5.68 # Clauses deleted for lack of memory : 0
% 41.63/5.68 # Backward-subsumed : 587
% 41.63/5.68 # Backward-rewritten : 209
% 41.63/5.68 # Generated clauses : 359062
% 41.63/5.68 # ...of the previous two non-redundant : 323782
% 41.63/5.68 # ...aggressively subsumed : 0
% 41.63/5.68 # Contextual simplify-reflections : 1
% 41.63/5.68 # Paramodulations : 358743
% 41.63/5.68 # Factorizations : 1
% 41.63/5.68 # NegExts : 0
% 41.63/5.68 # Equation resolutions : 318
% 41.63/5.68 # Disequality decompositions : 0
% 41.63/5.68 # Total rewrite steps : 263478
% 41.63/5.68 # ...of those cached : 228430
% 41.63/5.68 # Propositional unsat checks : 0
% 41.63/5.68 # Propositional check models : 0
% 41.63/5.68 # Propositional check unsatisfiable : 0
% 41.63/5.68 # Propositional clauses : 0
% 41.63/5.68 # Propositional clauses after purity: 0
% 41.63/5.68 # Propositional unsat core size : 0
% 41.63/5.68 # Propositional preprocessing time : 0.000
% 41.63/5.68 # Propositional encoding time : 0.000
% 41.63/5.68 # Propositional solver time : 0.000
% 41.63/5.68 # Success case prop preproc time : 0.000
% 41.63/5.68 # Success case prop encoding time : 0.000
% 41.63/5.68 # Success case prop solver time : 0.000
% 41.63/5.68 # Current number of processed clauses : 3740
% 41.63/5.68 # Positive orientable unit clauses : 1194
% 41.63/5.68 # Positive unorientable unit clauses: 27
% 41.63/5.68 # Negative unit clauses : 801
% 41.63/5.68 # Non-unit-clauses : 1718
% 41.63/5.68 # Current number of unprocessed clauses: 290894
% 41.63/5.68 # ...number of literals in the above : 624741
% 41.63/5.68 # Current number of archived formulas : 0
% 41.63/5.68 # Current number of archived clauses : 1109
% 41.63/5.68 # Clause-clause subsumption calls (NU) : 397284
% 41.63/5.68 # Rec. Clause-clause subsumption calls : 309232
% 41.63/5.68 # Non-unit clause-clause subsumptions : 4295
% 41.63/5.68 # Unit Clause-clause subsumption calls : 214267
% 41.63/5.68 # Rewrite failures with RHS unbound : 0
% 41.63/5.68 # BW rewrite match attempts : 8237
% 41.63/5.68 # BW rewrite match successes : 410
% 41.63/5.68 # Condensation attempts : 0
% 41.63/5.68 # Condensation successes : 0
% 41.63/5.68 # Termbank termtop insertions : 8287356
% 41.63/5.68 # Search garbage collected termcells : 921
% 41.63/5.68
% 41.63/5.68 # -------------------------------------------------
% 41.63/5.68 # User time : 4.924 s
% 41.63/5.68 # System time : 0.200 s
% 41.63/5.68 # Total time : 5.124 s
% 41.63/5.68 # Maximum resident set size: 2600 pages
% 41.63/5.68
% 41.63/5.68 # -------------------------------------------------
% 41.63/5.68 # User time : 4.930 s
% 41.63/5.68 # System time : 0.203 s
% 41.63/5.68 # Total time : 5.133 s
% 41.63/5.68 # Maximum resident set size: 2044 pages
% 41.63/5.68 % E---3.1 exiting
%------------------------------------------------------------------------------