TSTP Solution File: SWV258-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV258-1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 05:22:03 EDT 2024
% Result : Unsatisfiable 0.54s 0.60s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 31 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 29 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Message_Oparts__subset__iff_1,axiom,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_1) ).
cnf(cls_Message_Oparts__subset__iff_0,axiom,
( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_0) ).
cnf(cls_Set_Oinsert__subset_2,axiom,
( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_Oinsert__subset_2) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_6,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_7,plain,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__subset__iff_1]) ).
cnf(c_0_8,plain,
( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__subset__iff_0]) ).
cnf(c_0_9,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
c_0_6 ).
cnf(c_0_10,plain,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
c_0_7 ).
cnf(c_0_11,plain,
( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Oinsert__subset_2]) ).
cnf(c_0_12,plain,
( c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
c_0_8 ).
cnf(c_0_13,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_14,negated_conjecture,
~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
c_0_11 ).
cnf(c_0_16,plain,
c_lessequals(X1,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV258-1 : TPTP v8.2.0. Released v3.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.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:17:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/benchmark/theBenchmark.p
% 0.54/0.60 # Version: 3.1.0
% 0.54/0.60 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.54/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.54/0.60 # Starting sh5l with 300s (1) cores
% 0.54/0.60 # new_bool_3 with pid 31167 completed with status 0
% 0.54/0.60 # Result found by new_bool_3
% 0.54/0.60 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.54/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.60 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.54/0.60 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.60 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.54/0.60 # G-E--_303_C18_F1_URBAN_S0Y with pid 31171 completed with status 0
% 0.54/0.60 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.54/0.60 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.54/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.60 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.54/0.60 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.60 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.54/0.60 # Preprocessing time : 0.009 s
% 0.54/0.60
% 0.54/0.60 # Proof found!
% 0.54/0.60 # SZS status Unsatisfiable
% 0.54/0.60 # SZS output start CNFRefutation
% See solution above
% 0.54/0.60 # Parsed axioms : 2779
% 0.54/0.60 # Removed by relevancy pruning/SinE : 2491
% 0.54/0.60 # Initial clauses : 288
% 0.54/0.60 # Removed in clause preprocessing : 0
% 0.54/0.60 # Initial clauses in saturation : 288
% 0.54/0.60 # Processed clauses : 307
% 0.54/0.60 # ...of these trivial : 10
% 0.54/0.60 # ...subsumed : 43
% 0.54/0.60 # ...remaining for further processing : 254
% 0.54/0.60 # Other redundant clauses eliminated : 0
% 0.54/0.60 # Clauses deleted for lack of memory : 0
% 0.54/0.60 # Backward-subsumed : 2
% 0.54/0.60 # Backward-rewritten : 5
% 0.54/0.60 # Generated clauses : 1349
% 0.54/0.60 # ...of the previous two non-redundant : 932
% 0.54/0.60 # ...aggressively subsumed : 0
% 0.54/0.60 # Contextual simplify-reflections : 0
% 0.54/0.60 # Paramodulations : 1334
% 0.54/0.60 # Factorizations : 0
% 0.54/0.60 # NegExts : 0
% 0.54/0.60 # Equation resolutions : 15
% 0.54/0.60 # Disequality decompositions : 0
% 0.54/0.60 # Total rewrite steps : 503
% 0.54/0.60 # ...of those cached : 279
% 0.54/0.60 # Propositional unsat checks : 0
% 0.54/0.60 # Propositional check models : 0
% 0.54/0.60 # Propositional check unsatisfiable : 0
% 0.54/0.60 # Propositional clauses : 0
% 0.54/0.60 # Propositional clauses after purity: 0
% 0.54/0.60 # Propositional unsat core size : 0
% 0.54/0.60 # Propositional preprocessing time : 0.000
% 0.54/0.60 # Propositional encoding time : 0.000
% 0.54/0.60 # Propositional solver time : 0.000
% 0.54/0.60 # Success case prop preproc time : 0.000
% 0.54/0.60 # Success case prop encoding time : 0.000
% 0.54/0.60 # Success case prop solver time : 0.000
% 0.54/0.60 # Current number of processed clauses : 247
% 0.54/0.60 # Positive orientable unit clauses : 75
% 0.54/0.60 # Positive unorientable unit clauses: 0
% 0.54/0.60 # Negative unit clauses : 13
% 0.54/0.60 # Non-unit-clauses : 159
% 0.54/0.60 # Current number of unprocessed clauses: 911
% 0.54/0.60 # ...number of literals in the above : 2249
% 0.54/0.60 # Current number of archived formulas : 0
% 0.54/0.60 # Current number of archived clauses : 7
% 0.54/0.60 # Clause-clause subsumption calls (NU) : 5429
% 0.54/0.60 # Rec. Clause-clause subsumption calls : 2489
% 0.54/0.60 # Non-unit clause-clause subsumptions : 28
% 0.54/0.60 # Unit Clause-clause subsumption calls : 84
% 0.54/0.60 # Rewrite failures with RHS unbound : 0
% 0.54/0.60 # BW rewrite match attempts : 33
% 0.54/0.60 # BW rewrite match successes : 5
% 0.54/0.60 # Condensation attempts : 0
% 0.54/0.60 # Condensation successes : 0
% 0.54/0.60 # Termbank termtop insertions : 42850
% 0.54/0.60 # Search garbage collected termcells : 7664
% 0.54/0.60
% 0.54/0.60 # -------------------------------------------------
% 0.54/0.60 # User time : 0.049 s
% 0.54/0.60 # System time : 0.012 s
% 0.54/0.60 # Total time : 0.061 s
% 0.54/0.60 # Maximum resident set size: 4276 pages
% 0.54/0.60
% 0.54/0.60 # -------------------------------------------------
% 0.54/0.60 # User time : 0.100 s
% 0.54/0.60 # System time : 0.017 s
% 0.54/0.60 # Total time : 0.117 s
% 0.54/0.60 # Maximum resident set size: 3492 pages
% 0.54/0.60 % E---3.1 exiting
% 0.54/0.60 % E exiting
%------------------------------------------------------------------------------