TSTP Solution File: SWV281-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV281-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:44:01 EDT 2023
% Result : Unsatisfiable 4.90s 1.59s
% Output : CNFRefutation 4.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 13 unt; 3 nHn; 12 RR)
% Number of literals : 33 ( 12 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 30 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom,
( c_lessequals(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6fd65Qp0W9/E---3.1_21713.p',cls_Orderings_Oorder__class_Oaxioms__1_0) ).
cnf(clsarity_nat_3,axiom,
class_Orderings_Oorder(tc_nat),
file('/export/starexec/sandbox2/tmp/tmp.6fd65Qp0W9/E---3.1_21713.p',clsarity_nat_3) ).
cnf(cls_Public_ONonce__supply__lemma_0,axiom,
( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg)
| ~ c_lessequals(v_sko__urX(X2),X1,tc_nat) ),
file('/export/starexec/sandbox2/tmp/tmp.6fd65Qp0W9/E---3.1_21713.p',cls_Public_ONonce__supply__lemma_0) ).
cnf(cls_conjecture_0,negated_conjecture,
( X1 = X2
| c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/tmp/tmp.6fd65Qp0W9/E---3.1_21713.p',cls_conjecture_0) ).
cnf(cls_Nat_Ole__add2_0,axiom,
c_lessequals(X1,c_plus(X2,X1,tc_nat),tc_nat),
file('/export/starexec/sandbox2/tmp/tmp.6fd65Qp0W9/E---3.1_21713.p',cls_Nat_Ole__add2_0) ).
cnf(cls_Nat_Onat__add__right__cancel_0,axiom,
( X1 = X3
| c_plus(X1,X2,tc_nat) != c_plus(X3,X2,tc_nat) ),
file('/export/starexec/sandbox2/tmp/tmp.6fd65Qp0W9/E---3.1_21713.p',cls_Nat_Onat__add__right__cancel_0) ).
cnf(cls_IntDef_Oint__0__neq__1_0,axiom,
c_0 != c_1,
file('/export/starexec/sandbox2/tmp/tmp.6fd65Qp0W9/E---3.1_21713.p',cls_IntDef_Oint__0__neq__1_0) ).
cnf(c_0_7,axiom,
( c_lessequals(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
cls_Orderings_Oorder__class_Oaxioms__1_0 ).
cnf(c_0_8,axiom,
class_Orderings_Oorder(tc_nat),
clsarity_nat_3 ).
cnf(c_0_9,axiom,
( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg)
| ~ c_lessequals(v_sko__urX(X2),X1,tc_nat) ),
cls_Public_ONonce__supply__lemma_0 ).
cnf(c_0_10,plain,
c_lessequals(X1,X1,tc_nat),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
~ c_in(c_Message_Omsg_ONonce(v_sko__urX(X1)),c_Event_Oused(X1),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( X1 = X2
| c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg) ),
cls_conjecture_0 ).
cnf(c_0_13,axiom,
c_lessequals(X1,c_plus(X2,X1,tc_nat),tc_nat),
cls_Nat_Ole__add2_0 ).
cnf(c_0_14,negated_conjecture,
( X1 = v_sko__urX(v_evs_H)
| c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
~ c_in(c_Message_Omsg_ONonce(c_plus(X1,v_sko__urX(X2),tc_nat)),c_Event_Oused(X2),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
v_sko__urX(v_evs) = v_sko__urX(v_evs_H),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_17,axiom,
( X1 = X3
| c_plus(X1,X2,tc_nat) != c_plus(X3,X2,tc_nat) ),
cls_Nat_Onat__add__right__cancel_0 ).
cnf(c_0_18,negated_conjecture,
c_plus(X1,v_sko__urX(v_evs_H),tc_nat) = v_sko__urX(v_evs_H),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
cnf(c_0_19,axiom,
c_0 != c_1,
cls_IntDef_Oint__0__neq__1_0 ).
cnf(c_0_20,negated_conjecture,
X1 = X2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_18])]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.32 % Problem : SWV281-1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.33 % Command : run_E %s %d THM
% 0.33/0.54 % Computer : n002.cluster.edu
% 0.33/0.54 % Model : x86_64 x86_64
% 0.33/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.33/0.54 % Memory : 8042.1875MB
% 0.33/0.54 % OS : Linux 3.10.0-693.el7.x86_64
% 0.33/0.54 % CPULimit : 2400
% 0.33/0.54 % WCLimit : 300
% 0.33/0.54 % DateTime : Tue Oct 3 03:58:30 EDT 2023
% 0.33/0.54 % CPUTime :
% 0.77/0.97 Running first-order theorem proving
% 0.77/0.97 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/tmp/tmp.6fd65Qp0W9/E---3.1_21713.p
% 4.90/1.59 # Version: 3.1pre001
% 4.90/1.59 # Preprocessing class: FMLMSMSMSSSNFFN.
% 4.90/1.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.90/1.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.90/1.59 # Starting new_bool_3 with 300s (1) cores
% 4.90/1.59 # Starting new_bool_1 with 300s (1) cores
% 4.90/1.59 # Starting sh5l with 300s (1) cores
% 4.90/1.59 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21791 completed with status 0
% 4.90/1.59 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.90/1.59 # Preprocessing class: FMLMSMSMSSSNFFN.
% 4.90/1.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.90/1.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.90/1.59 # No SInE strategy applied
% 4.90/1.59 # Search class: FGHSM-SMLM32-DFFFFFNN
% 4.90/1.59 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 4.90/1.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 4.90/1.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.90/1.59 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 4.90/1.59 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 4.90/1.59 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 4.90/1.59 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with pid 21802 completed with status 0
% 4.90/1.59 # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 4.90/1.59 # Preprocessing class: FMLMSMSMSSSNFFN.
% 4.90/1.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.90/1.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.90/1.59 # No SInE strategy applied
% 4.90/1.59 # Search class: FGHSM-SMLM32-DFFFFFNN
% 4.90/1.59 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 4.90/1.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 4.90/1.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.90/1.59 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 4.90/1.59 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 4.90/1.59 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 4.90/1.59 # Preprocessing time : 0.030 s
% 4.90/1.59 # Presaturation interreduction done
% 4.90/1.59
% 4.90/1.59 # Proof found!
% 4.90/1.59 # SZS status Unsatisfiable
% 4.90/1.59 # SZS output start CNFRefutation
% See solution above
% 4.90/1.59 # Parsed axioms : 2938
% 4.90/1.59 # Removed by relevancy pruning/SinE : 0
% 4.90/1.59 # Initial clauses : 2938
% 4.90/1.59 # Removed in clause preprocessing : 12
% 4.90/1.59 # Initial clauses in saturation : 2926
% 4.90/1.59 # Processed clauses : 5178
% 4.90/1.59 # ...of these trivial : 30
% 4.90/1.59 # ...subsumed : 520
% 4.90/1.59 # ...remaining for further processing : 4628
% 4.90/1.59 # Other redundant clauses eliminated : 397
% 4.90/1.59 # Clauses deleted for lack of memory : 0
% 4.90/1.59 # Backward-subsumed : 439
% 4.90/1.59 # Backward-rewritten : 51
% 4.90/1.59 # Generated clauses : 8750
% 4.90/1.59 # ...of the previous two non-redundant : 4826
% 4.90/1.59 # ...aggressively subsumed : 0
% 4.90/1.59 # Contextual simplify-reflections : 1
% 4.90/1.59 # Paramodulations : 8250
% 4.90/1.59 # Factorizations : 8
% 4.90/1.59 # NegExts : 0
% 4.90/1.59 # Equation resolutions : 441
% 4.90/1.59 # Total rewrite steps : 2677
% 4.90/1.59 # Propositional unsat checks : 0
% 4.90/1.59 # Propositional check models : 0
% 4.90/1.59 # Propositional check unsatisfiable : 0
% 4.90/1.59 # Propositional clauses : 0
% 4.90/1.59 # Propositional clauses after purity: 0
% 4.90/1.59 # Propositional unsat core size : 0
% 4.90/1.59 # Propositional preprocessing time : 0.000
% 4.90/1.59 # Propositional encoding time : 0.000
% 4.90/1.59 # Propositional solver time : 0.000
% 4.90/1.59 # Success case prop preproc time : 0.000
% 4.90/1.59 # Success case prop encoding time : 0.000
% 4.90/1.59 # Success case prop solver time : 0.000
% 4.90/1.59 # Current number of processed clauses : 1316
% 4.90/1.59 # Positive orientable unit clauses : 216
% 4.90/1.59 # Positive unorientable unit clauses: 1
% 4.90/1.59 # Negative unit clauses : 108
% 4.90/1.59 # Non-unit-clauses : 991
% 4.90/1.59 # Current number of unprocessed clauses: 5299
% 4.90/1.59 # ...number of literals in the above : 13876
% 4.90/1.59 # Current number of archived formulas : 0
% 4.90/1.59 # Current number of archived clauses : 3322
% 4.90/1.59 # Clause-clause subsumption calls (NU) : 2490931
% 4.90/1.59 # Rec. Clause-clause subsumption calls : 1500282
% 4.90/1.59 # Non-unit clause-clause subsumptions : 345
% 4.90/1.59 # Unit Clause-clause subsumption calls : 129558
% 4.90/1.59 # Rewrite failures with RHS unbound : 1589
% 4.90/1.59 # BW rewrite match attempts : 3400
% 4.90/1.59 # BW rewrite match successes : 1652
% 4.90/1.59 # Condensation attempts : 0
% 4.90/1.59 # Condensation successes : 0
% 4.90/1.59 # Termbank termtop insertions : 152375
% 4.90/1.59
% 4.90/1.59 # -------------------------------------------------
% 4.90/1.59 # User time : 0.536 s
% 4.90/1.59 # System time : 0.026 s
% 4.90/1.59 # Total time : 0.562 s
% 4.90/1.59 # Maximum resident set size: 6644 pages
% 4.90/1.59
% 4.90/1.59 # -------------------------------------------------
% 4.90/1.59 # User time : 2.516 s
% 4.90/1.59 # System time : 0.093 s
% 4.90/1.59 # Total time : 2.609 s
% 4.90/1.59 # Maximum resident set size: 3608 pages
% 4.90/1.59 % E---3.1 exiting
% 4.90/1.59 % E---3.1 exiting
%------------------------------------------------------------------------------