TSTP Solution File: SWV283-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV283-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:02 EDT 2023
% Result : Unsatisfiable 0.49s 0.95s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 5 unt; 5 nHn; 12 RR)
% Number of literals : 39 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 35 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_9,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_xd(X2)),c_Event_Oused(v_list),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_xd(X2)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/tmp/tmp.2MNBQvDQLW/E---3.1_2492.p',cls_conjecture_9) ).
cnf(cls_Message_Omsg__Nonce__supply_0,axiom,
( ~ c_in(c_Message_Omsg_ONonce(X1),c_Message_Oparts(c_insert(X2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_lessequals(v_sko__upX(X2),X1,tc_nat) ),
file('/export/starexec/sandbox2/tmp/tmp.2MNBQvDQLW/E---3.1_2492.p',cls_Message_Omsg__Nonce__supply_0) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_lessequals(X1,v_xd(X1),tc_nat)
| c_lessequals(X2,v_xd(X2),tc_nat) ),
file('/export/starexec/sandbox2/tmp/tmp.2MNBQvDQLW/E---3.1_2492.p',cls_conjecture_4) ).
cnf(cls_conjecture_0,negated_conjecture,
( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_list),tc_Message_Omsg)
| ~ c_lessequals(v_x,X1,tc_nat) ),
file('/export/starexec/sandbox2/tmp/tmp.2MNBQvDQLW/E---3.1_2492.p',cls_conjecture_0) ).
cnf(cls_Nat_Oadd__leE_1,axiom,
( c_lessequals(X1,X3,tc_nat)
| ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
file('/export/starexec/sandbox2/tmp/tmp.2MNBQvDQLW/E---3.1_2492.p',cls_Nat_Oadd__leE_1) ).
cnf(cls_Nat_Oadd__leE_0,axiom,
( c_lessequals(X2,X3,tc_nat)
| ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
file('/export/starexec/sandbox2/tmp/tmp.2MNBQvDQLW/E---3.1_2492.p',cls_Nat_Oadd__leE_0) ).
cnf(c_0_6,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_xd(X2)),c_Event_Oused(v_list),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_xd(X2)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
cls_conjecture_9 ).
cnf(c_0_7,axiom,
( ~ c_in(c_Message_Omsg_ONonce(X1),c_Message_Oparts(c_insert(X2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_lessequals(v_sko__upX(X2),X1,tc_nat) ),
cls_Message_Omsg__Nonce__supply_0 ).
cnf(c_0_8,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg) ),
inference(ef,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( c_lessequals(X1,v_xd(X1),tc_nat)
| c_lessequals(X2,v_xd(X2),tc_nat) ),
cls_conjecture_4 ).
cnf(c_0_10,negated_conjecture,
( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_list),tc_Message_Omsg)
| ~ c_lessequals(v_x,X1,tc_nat) ),
cls_conjecture_0 ).
cnf(c_0_11,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
| ~ c_lessequals(v_sko__upX(v_xc),v_xd(X1),tc_nat) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,axiom,
( c_lessequals(X1,X3,tc_nat)
| ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
cls_Nat_Oadd__leE_1 ).
cnf(c_0_13,negated_conjecture,
c_lessequals(X1,v_xd(X1),tc_nat),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( ~ c_lessequals(v_sko__upX(v_xc),v_xd(X1),tc_nat)
| ~ c_lessequals(v_x,v_xd(X1),tc_nat) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
c_lessequals(X1,v_xd(c_plus(X1,X2,tc_nat)),tc_nat),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
( c_lessequals(X2,X3,tc_nat)
| ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
cls_Nat_Oadd__leE_0 ).
cnf(c_0_17,negated_conjecture,
~ c_lessequals(v_x,v_xd(c_plus(v_sko__upX(v_xc),X1,tc_nat)),tc_nat),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
c_lessequals(X1,v_xd(c_plus(X2,X1,tc_nat)),tc_nat),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.22 % Problem : SWV283-1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.23 % Command : run_E %s %d THM
% 0.21/0.43 % Computer : n008.cluster.edu
% 0.21/0.43 % Model : x86_64 x86_64
% 0.21/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.43 % Memory : 8042.1875MB
% 0.21/0.43 % OS : Linux 3.10.0-693.el7.x86_64
% 0.21/0.43 % CPULimit : 2400
% 0.21/0.43 % WCLimit : 300
% 0.21/0.43 % DateTime : Tue Oct 3 03:48:43 EDT 2023
% 0.21/0.43 % CPUTime :
% 0.45/0.67 Running first-order theorem proving
% 0.45/0.67 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.2MNBQvDQLW/E---3.1_2492.p
% 0.49/0.95 # Version: 3.1pre001
% 0.49/0.95 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.49/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.95 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/0.95 # Starting new_bool_3 with 300s (1) cores
% 0.49/0.95 # Starting new_bool_1 with 300s (1) cores
% 0.49/0.95 # Starting sh5l with 300s (1) cores
% 0.49/0.95 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2570 completed with status 0
% 0.49/0.95 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.49/0.95 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.49/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.95 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/0.95 # No SInE strategy applied
% 0.49/0.95 # Search class: FGHSM-SSLM32-MFFFFFNN
% 0.49/0.95 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.95 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 0.49/0.95 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.49/0.95 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 0.49/0.95 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.49/0.95 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.49/0.95 # G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with pid 2578 completed with status 0
% 0.49/0.95 # Result found by G-E--_208_C47_F1_SE_CS_SP_PS_S0Y
% 0.49/0.95 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.49/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.95 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/0.95 # No SInE strategy applied
% 0.49/0.95 # Search class: FGHSM-SSLM32-MFFFFFNN
% 0.49/0.95 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.95 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 811s (1) cores
% 0.49/0.95 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.49/0.95 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 136s (1) cores
% 0.49/0.95 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.49/0.95 # Preprocessing time : 0.010 s
% 0.49/0.95 # Presaturation interreduction done
% 0.49/0.95
% 0.49/0.95 # Proof found!
% 0.49/0.95 # SZS status Unsatisfiable
% 0.49/0.95 # SZS output start CNFRefutation
% See solution above
% 0.49/0.95 # Parsed axioms : 1478
% 0.49/0.95 # Removed by relevancy pruning/SinE : 0
% 0.49/0.95 # Initial clauses : 1478
% 0.49/0.95 # Removed in clause preprocessing : 3
% 0.49/0.95 # Initial clauses in saturation : 1475
% 0.49/0.95 # Processed clauses : 3225
% 0.49/0.95 # ...of these trivial : 29
% 0.49/0.95 # ...subsumed : 316
% 0.49/0.95 # ...remaining for further processing : 2880
% 0.49/0.95 # Other redundant clauses eliminated : 4
% 0.49/0.95 # Clauses deleted for lack of memory : 0
% 0.49/0.95 # Backward-subsumed : 19
% 0.49/0.95 # Backward-rewritten : 29
% 0.49/0.95 # Generated clauses : 1912
% 0.49/0.95 # ...of the previous two non-redundant : 814
% 0.49/0.95 # ...aggressively subsumed : 0
% 0.49/0.95 # Contextual simplify-reflections : 0
% 0.49/0.95 # Paramodulations : 1853
% 0.49/0.95 # Factorizations : 4
% 0.49/0.95 # NegExts : 0
% 0.49/0.95 # Equation resolutions : 55
% 0.49/0.95 # Total rewrite steps : 1244
% 0.49/0.95 # Propositional unsat checks : 0
% 0.49/0.95 # Propositional check models : 0
% 0.49/0.95 # Propositional check unsatisfiable : 0
% 0.49/0.95 # Propositional clauses : 0
% 0.49/0.95 # Propositional clauses after purity: 0
% 0.49/0.95 # Propositional unsat core size : 0
% 0.49/0.95 # Propositional preprocessing time : 0.000
% 0.49/0.95 # Propositional encoding time : 0.000
% 0.49/0.95 # Propositional solver time : 0.000
% 0.49/0.95 # Success case prop preproc time : 0.000
% 0.49/0.95 # Success case prop encoding time : 0.000
% 0.49/0.95 # Success case prop solver time : 0.000
% 0.49/0.95 # Current number of processed clauses : 1414
% 0.49/0.95 # Positive orientable unit clauses : 210
% 0.49/0.95 # Positive unorientable unit clauses: 0
% 0.49/0.95 # Negative unit clauses : 52
% 0.49/0.95 # Non-unit-clauses : 1152
% 0.49/0.95 # Current number of unprocessed clauses: 452
% 0.49/0.95 # ...number of literals in the above : 1098
% 0.49/0.95 # Current number of archived formulas : 0
% 0.49/0.95 # Current number of archived clauses : 1467
% 0.49/0.95 # Clause-clause subsumption calls (NU) : 1014217
% 0.49/0.95 # Rec. Clause-clause subsumption calls : 972652
% 0.49/0.95 # Non-unit clause-clause subsumptions : 272
% 0.49/0.95 # Unit Clause-clause subsumption calls : 20475
% 0.49/0.95 # Rewrite failures with RHS unbound : 0
% 0.49/0.95 # BW rewrite match attempts : 105
% 0.49/0.95 # BW rewrite match successes : 23
% 0.49/0.95 # Condensation attempts : 0
% 0.49/0.95 # Condensation successes : 0
% 0.49/0.95 # Termbank termtop insertions : 50189
% 0.49/0.95
% 0.49/0.95 # -------------------------------------------------
% 0.49/0.95 # User time : 0.240 s
% 0.49/0.95 # System time : 0.006 s
% 0.49/0.95 # Total time : 0.246 s
% 0.49/0.95 # Maximum resident set size: 3944 pages
% 0.49/0.95
% 0.49/0.95 # -------------------------------------------------
% 0.49/0.95 # User time : 1.185 s
% 0.49/0.95 # System time : 0.037 s
% 0.49/0.95 # Total time : 1.222 s
% 0.49/0.95 # Maximum resident set size: 2480 pages
% 0.49/0.95 % E---3.1 exiting
% 0.49/0.96 % E---3.1 exiting
%------------------------------------------------------------------------------