TSTP Solution File: SWV249-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV249-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:43:51 EDT 2023
% Result : Unsatisfiable 115.68s 15.60s
% Output : CNFRefutation 115.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 39 ( 24 unt; 0 nHn; 21 RR)
% Number of literals : 61 ( 12 equ; 27 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 95 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OUn__subset__iff_1,axiom,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Set_OUn__subset__iff_1) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Set_Osubset__refl_0) ).
cnf(cls_Set_OUn__subset__iff_2,axiom,
( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Set_OUn__subset__iff_2) ).
cnf(cls_Set_OUn__Diff__cancel2_0,axiom,
c_union(c_minus(X1,X2,tc_set(X3)),X2,X3) = c_union(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Set_OUn__Diff__cancel2_0) ).
cnf(cls_Set_OUn__Diff__cancel_0,axiom,
c_union(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_union(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Set_OUn__Diff__cancel_0) ).
cnf(cls_Set_OUn__subset__iff_0,axiom,
( c_lessequals(X1,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Set_OUn__subset__iff_0) ).
cnf(cls_Set_Osubset__antisym_0,axiom,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_Message_Oanalz__synth__Un_0,axiom,
c_Message_Oanalz(c_union(c_Message_Osynth(X1),X2,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),c_Message_Osynth(X1),tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Message_Oanalz__synth__Un_0) ).
cnf(cls_Message_Oanalz__analz__Un_0,axiom,
c_Message_Oanalz(c_union(c_Message_Oanalz(X1),X2,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Message_Oanalz__analz__Un_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.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/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Message_Oanalz__mono_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/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Set_Oinsert__subset_2) ).
cnf(cls_Set_OUn__iff_2,axiom,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_Set_OUn__iff_2) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.xDtlLLAy6w/E---3.1_10093.p',cls_conjecture_0) ).
cnf(c_0_14,axiom,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
cls_Set_OUn__subset__iff_1 ).
cnf(c_0_15,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_16,axiom,
( c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
cls_Set_OUn__subset__iff_2 ).
cnf(c_0_17,axiom,
c_union(c_minus(X1,X2,tc_set(X3)),X2,X3) = c_union(X1,X2,X3),
cls_Set_OUn__Diff__cancel2_0 ).
cnf(c_0_18,plain,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
c_union(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_union(X1,X2,X3),
cls_Set_OUn__Diff__cancel_0 ).
cnf(c_0_20,axiom,
( c_lessequals(X1,X4,tc_set(X3))
| ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
cls_Set_OUn__subset__iff_0 ).
cnf(c_0_21,plain,
( c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| ~ c_lessequals(c_minus(X1,X2,tc_set(X3)),X4,tc_set(X3))
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
c_lessequals(c_minus(X1,X2,tc_set(X3)),c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_24,axiom,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
cls_Set_Osubset__antisym_0 ).
cnf(c_0_25,plain,
c_lessequals(c_union(X1,X2,X3),c_union(X2,X1,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,axiom,
c_Message_Oanalz(c_union(c_Message_Osynth(X1),X2,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),c_Message_Osynth(X1),tc_Message_Omsg),
cls_Message_Oanalz__synth__Un_0 ).
cnf(c_0_27,axiom,
c_Message_Oanalz(c_union(c_Message_Oanalz(X1),X2,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),
cls_Message_Oanalz__analz__Un_0 ).
cnf(c_0_28,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
cls_conjecture_1 ).
cnf(c_0_29,plain,
c_union(X1,X2,X3) = c_union(X2,X1,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_25])]) ).
cnf(c_0_30,plain,
c_union(c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),c_Message_Osynth(c_Message_Oanalz(X1)),tc_Message_Omsg) = c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(X1)),X2,tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_29]) ).
cnf(c_0_32,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)) ),
cls_Message_Oanalz__mono_0 ).
cnf(c_0_33,negated_conjecture,
~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,axiom,
( c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3)) ),
cls_Set_Oinsert__subset_2 ).
cnf(c_0_35,negated_conjecture,
~ c_in(v_X,c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),tc_Message_Omsg),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_23])]) ).
cnf(c_0_36,axiom,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OUn__iff_2 ).
cnf(c_0_37,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.31/0.31 % Problem : SWV249-1 : TPTP v8.1.2. Released v3.2.0.
% 0.31/0.32 % Command : run_E %s %d THM
% 0.32/0.52 % Computer : n008.cluster.edu
% 0.32/0.52 % Model : x86_64 x86_64
% 0.32/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.32/0.52 % Memory : 8042.1875MB
% 0.32/0.52 % OS : Linux 3.10.0-693.el7.x86_64
% 0.32/0.52 % CPULimit : 2400
% 0.32/0.52 % WCLimit : 300
% 0.32/0.52 % DateTime : Tue Oct 3 04:02:58 EDT 2023
% 0.32/0.52 % CPUTime :
% 0.46/0.93 Running first-order theorem proving
% 0.46/0.93 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.xDtlLLAy6w/E---3.1_10093.p
% 115.68/15.60 # Version: 3.1pre001
% 115.68/15.60 # Preprocessing class: FMLMSMSMSSSNFFN.
% 115.68/15.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 115.68/15.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 115.68/15.60 # Starting new_bool_3 with 300s (1) cores
% 115.68/15.60 # Starting new_bool_1 with 300s (1) cores
% 115.68/15.60 # Starting sh5l with 300s (1) cores
% 115.68/15.60 # new_bool_3 with pid 10172 completed with status 0
% 115.68/15.60 # Result found by new_bool_3
% 115.68/15.60 # Preprocessing class: FMLMSMSMSSSNFFN.
% 115.68/15.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 115.68/15.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 115.68/15.60 # Starting new_bool_3 with 300s (1) cores
% 115.68/15.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 115.68/15.60 # Search class: FGHSM-FSLM32-MFFFFFNN
% 115.68/15.60 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 115.68/15.60 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 115.68/15.60 # G-E--_303_C18_F1_URBAN_S0Y with pid 10176 completed with status 0
% 115.68/15.60 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 115.68/15.60 # Preprocessing class: FMLMSMSMSSSNFFN.
% 115.68/15.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 115.68/15.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 115.68/15.60 # Starting new_bool_3 with 300s (1) cores
% 115.68/15.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 115.68/15.60 # Search class: FGHSM-FSLM32-MFFFFFNN
% 115.68/15.60 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 115.68/15.60 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 115.68/15.60 # Preprocessing time : 0.018 s
% 115.68/15.60
% 115.68/15.60 # Proof found!
% 115.68/15.60 # SZS status Unsatisfiable
% 115.68/15.60 # SZS output start CNFRefutation
% See solution above
% 115.68/15.60 # Parsed axioms : 2830
% 115.68/15.60 # Removed by relevancy pruning/SinE : 2404
% 115.68/15.60 # Initial clauses : 426
% 115.68/15.60 # Removed in clause preprocessing : 0
% 115.68/15.60 # Initial clauses in saturation : 426
% 115.68/15.60 # Processed clauses : 15836
% 115.68/15.60 # ...of these trivial : 312
% 115.68/15.60 # ...subsumed : 11090
% 115.68/15.60 # ...remaining for further processing : 4434
% 115.68/15.60 # Other redundant clauses eliminated : 76
% 115.68/15.60 # Clauses deleted for lack of memory : 0
% 115.68/15.60 # Backward-subsumed : 283
% 115.68/15.60 # Backward-rewritten : 341
% 115.68/15.60 # Generated clauses : 464018
% 115.68/15.60 # ...of the previous two non-redundant : 415724
% 115.68/15.60 # ...aggressively subsumed : 0
% 115.68/15.60 # Contextual simplify-reflections : 451
% 115.68/15.60 # Paramodulations : 463886
% 115.68/15.60 # Factorizations : 4
% 115.68/15.60 # NegExts : 0
% 115.68/15.60 # Equation resolutions : 128
% 115.68/15.60 # Total rewrite steps : 324016
% 115.68/15.60 # Propositional unsat checks : 0
% 115.68/15.60 # Propositional check models : 0
% 115.68/15.60 # Propositional check unsatisfiable : 0
% 115.68/15.60 # Propositional clauses : 0
% 115.68/15.60 # Propositional clauses after purity: 0
% 115.68/15.60 # Propositional unsat core size : 0
% 115.68/15.60 # Propositional preprocessing time : 0.000
% 115.68/15.60 # Propositional encoding time : 0.000
% 115.68/15.60 # Propositional solver time : 0.000
% 115.68/15.60 # Success case prop preproc time : 0.000
% 115.68/15.60 # Success case prop encoding time : 0.000
% 115.68/15.60 # Success case prop solver time : 0.000
% 115.68/15.60 # Current number of processed clauses : 3810
% 115.68/15.60 # Positive orientable unit clauses : 500
% 115.68/15.60 # Positive unorientable unit clauses: 7
% 115.68/15.60 # Negative unit clauses : 372
% 115.68/15.60 # Non-unit-clauses : 2931
% 115.68/15.60 # Current number of unprocessed clauses: 398698
% 115.68/15.60 # ...number of literals in the above : 1502648
% 115.68/15.60 # Current number of archived formulas : 0
% 115.68/15.60 # Current number of archived clauses : 624
% 115.68/15.60 # Clause-clause subsumption calls (NU) : 1419184
% 115.68/15.60 # Rec. Clause-clause subsumption calls : 467746
% 115.68/15.60 # Non-unit clause-clause subsumptions : 5543
% 115.68/15.60 # Unit Clause-clause subsumption calls : 100932
% 115.68/15.60 # Rewrite failures with RHS unbound : 0
% 115.68/15.60 # BW rewrite match attempts : 3281
% 115.68/15.60 # BW rewrite match successes : 924
% 115.68/15.60 # Condensation attempts : 0
% 115.68/15.60 # Condensation successes : 0
% 115.68/15.60 # Termbank termtop insertions : 12116604
% 115.68/15.60
% 115.68/15.60 # -------------------------------------------------
% 115.68/15.60 # User time : 13.897 s
% 115.68/15.60 # System time : 0.432 s
% 115.68/15.60 # Total time : 14.328 s
% 115.68/15.60 # Maximum resident set size: 4452 pages
% 115.68/15.60
% 115.68/15.60 # -------------------------------------------------
% 115.68/15.60 # User time : 13.943 s
% 115.68/15.60 # System time : 0.437 s
% 115.68/15.60 # Total time : 14.381 s
% 115.68/15.60 # Maximum resident set size: 3540 pages
% 115.68/15.60 % E---3.1 exiting
% 115.68/15.60 % E---3.1 exiting
%------------------------------------------------------------------------------