TSTP Solution File: SWV242-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV242-1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 05:33:46 EDT 2024
% Result : Unsatisfiable 0.54s 0.57s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 10 unt; 0 nHn; 19 RR)
% Number of literals : 39 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 34 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__trans_0,axiom,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Message_Oanalz__mono_0,axiom,
( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__mono_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_OUn__upper2_0,axiom,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__upper2_0) ).
cnf(cls_Set_OUn__upper1_0,axiom,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__upper1_0) ).
cnf(c_0_7,plain,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__trans_0]) ).
cnf(c_0_8,plain,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
c_0_7 ).
cnf(c_0_9,negated_conjecture,
c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)),
cls_conjecture_1 ).
cnf(c_0_10,plain,
( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__mono_0]) ).
cnf(c_0_11,negated_conjecture,
( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_12,negated_conjecture,
( c_lessequals(v_H,X1,tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(v_H_H),X1,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)),
cls_conjecture_0 ).
cnf(c_0_15,negated_conjecture,
( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
( c_lessequals(v_H,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(v_H_H,X1,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
cls_Set_OUn__upper2_0 ).
cnf(c_0_18,negated_conjecture,
( c_lessequals(v_G,X1,tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(v_G_H),X1,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
( c_lessequals(v_G,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg))
| ~ c_lessequals(v_G_H,X1,tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_21,axiom,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
cls_Set_OUn__upper1_0 ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV242-1 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.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 09:02:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.54/0.57 # Version: 3.1.0
% 0.54/0.57 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.54/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.54/0.57 # Starting sh5l with 300s (1) cores
% 0.54/0.57 # new_bool_1 with pid 8687 completed with status 0
% 0.54/0.57 # Result found by new_bool_1
% 0.54/0.57 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.54/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.54/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.57 # Search class: FGHSM-FSLM31-SFFFFFNN
% 0.54/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 0.54/0.57 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 8689 completed with status 0
% 0.54/0.57 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.54/0.57 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.54/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.54/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.57 # Search class: FGHSM-FSLM31-SFFFFFNN
% 0.54/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 0.54/0.57 # Preprocessing time : 0.008 s
% 0.54/0.57
% 0.54/0.57 # Proof found!
% 0.54/0.57 # SZS status Unsatisfiable
% 0.54/0.57 # SZS output start CNFRefutation
% See solution above
% 0.54/0.57 # Parsed axioms : 1392
% 0.54/0.57 # Removed by relevancy pruning/SinE : 984
% 0.54/0.57 # Initial clauses : 408
% 0.54/0.57 # Removed in clause preprocessing : 0
% 0.54/0.57 # Initial clauses in saturation : 408
% 0.54/0.57 # Processed clauses : 597
% 0.54/0.57 # ...of these trivial : 1
% 0.54/0.57 # ...subsumed : 117
% 0.54/0.57 # ...remaining for further processing : 479
% 0.54/0.57 # Other redundant clauses eliminated : 0
% 0.54/0.57 # Clauses deleted for lack of memory : 0
% 0.54/0.57 # Backward-subsumed : 6
% 0.54/0.57 # Backward-rewritten : 2
% 0.54/0.57 # Generated clauses : 586
% 0.54/0.57 # ...of the previous two non-redundant : 416
% 0.54/0.57 # ...aggressively subsumed : 0
% 0.54/0.57 # Contextual simplify-reflections : 1
% 0.54/0.57 # Paramodulations : 581
% 0.54/0.57 # Factorizations : 0
% 0.54/0.57 # NegExts : 0
% 0.54/0.57 # Equation resolutions : 5
% 0.54/0.57 # Disequality decompositions : 0
% 0.54/0.57 # Total rewrite steps : 130
% 0.54/0.57 # ...of those cached : 92
% 0.54/0.57 # Propositional unsat checks : 0
% 0.54/0.57 # Propositional check models : 0
% 0.54/0.57 # Propositional check unsatisfiable : 0
% 0.54/0.57 # Propositional clauses : 0
% 0.54/0.57 # Propositional clauses after purity: 0
% 0.54/0.57 # Propositional unsat core size : 0
% 0.54/0.57 # Propositional preprocessing time : 0.000
% 0.54/0.57 # Propositional encoding time : 0.000
% 0.54/0.57 # Propositional solver time : 0.000
% 0.54/0.57 # Success case prop preproc time : 0.000
% 0.54/0.57 # Success case prop encoding time : 0.000
% 0.54/0.57 # Success case prop solver time : 0.000
% 0.54/0.57 # Current number of processed clauses : 471
% 0.54/0.57 # Positive orientable unit clauses : 45
% 0.54/0.57 # Positive unorientable unit clauses: 0
% 0.54/0.57 # Negative unit clauses : 6
% 0.54/0.57 # Non-unit-clauses : 420
% 0.54/0.57 # Current number of unprocessed clauses: 220
% 0.54/0.57 # ...number of literals in the above : 678
% 0.54/0.57 # Current number of archived formulas : 0
% 0.54/0.57 # Current number of archived clauses : 8
% 0.54/0.57 # Clause-clause subsumption calls (NU) : 62864
% 0.54/0.57 # Rec. Clause-clause subsumption calls : 52004
% 0.54/0.57 # Non-unit clause-clause subsumptions : 118
% 0.54/0.57 # Unit Clause-clause subsumption calls : 112
% 0.54/0.57 # Rewrite failures with RHS unbound : 0
% 0.54/0.57 # BW rewrite match attempts : 60
% 0.54/0.57 # BW rewrite match successes : 2
% 0.54/0.57 # Condensation attempts : 0
% 0.54/0.57 # Condensation successes : 0
% 0.54/0.57 # Termbank termtop insertions : 21920
% 0.54/0.57 # Search garbage collected termcells : 2542
% 0.54/0.57
% 0.54/0.57 # -------------------------------------------------
% 0.54/0.57 # User time : 0.051 s
% 0.54/0.57 # System time : 0.007 s
% 0.54/0.57 # Total time : 0.058 s
% 0.54/0.57 # Maximum resident set size: 3076 pages
% 0.54/0.57
% 0.54/0.57 # -------------------------------------------------
% 0.54/0.57 # User time : 0.079 s
% 0.54/0.57 # System time : 0.010 s
% 0.54/0.57 # Total time : 0.089 s
% 0.54/0.57 # Maximum resident set size: 2428 pages
% 0.54/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------