TSTP Solution File: SWV251-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV251-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:52 EDT 2023
% Result : Unsatisfiable 89.59s 12.56s
% Output : CNFRefutation 89.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 45 ( 24 unt; 4 nHn; 26 RR)
% Number of literals : 74 ( 12 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 98 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_ODiff__iff_2,axiom,
( c_in(X1,X4,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.G9bdPZtKUl/E---3.1_21762.p',cls_Set_ODiff__iff_2) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.G9bdPZtKUl/E---3.1_21762.p',cls_conjecture_1) ).
cnf(cls_Message_Oanalz__subset__iff_0,axiom,
( c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/tmp/tmp.G9bdPZtKUl/E---3.1_21762.p',cls_Message_Oanalz__subset__iff_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox2/tmp/tmp.G9bdPZtKUl/E---3.1_21762.p',cls_Set_Osubset__refl_0) ).
cnf(cls_Set_ODiff__eq__empty__iff_1,axiom,
( c_minus(X1,X2,tc_set(X3)) = c_emptyset
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.G9bdPZtKUl/E---3.1_21762.p',cls_Set_ODiff__eq__empty__iff_1) ).
cnf(cls_Set_Oempty__iff_0,axiom,
~ c_in(X1,c_emptyset,X2),
file('/export/starexec/sandbox2/tmp/tmp.G9bdPZtKUl/E---3.1_21762.p',cls_Set_Oempty__iff_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.G9bdPZtKUl/E---3.1_21762.p',cls_Set_OUn__subset__iff_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.G9bdPZtKUl/E---3.1_21762.p',cls_Message_Oanalz__analz__Un_0) ).
cnf(cls_Set_OUn__insert__left_0,axiom,
c_union(c_insert(X1,X2,X3),X4,X3) = c_insert(X1,c_union(X2,X4,X3),X3),
file('/export/starexec/sandbox2/tmp/tmp.G9bdPZtKUl/E---3.1_21762.p',cls_Set_OUn__insert__left_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.G9bdPZtKUl/E---3.1_21762.p',cls_Set_Osubset__antisym_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.G9bdPZtKUl/E---3.1_21762.p',cls_Set_Oinsert__subset_2) ).
cnf(cls_Set_Oinsert__subset_1,axiom,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.G9bdPZtKUl/E---3.1_21762.p',cls_Set_Oinsert__subset_1) ).
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.G9bdPZtKUl/E---3.1_21762.p',cls_conjecture_0) ).
cnf(cls_Message_Ostrange__Un__eq_0,axiom,
c_union(X1,c_union(X2,X1,X3),X3) = c_union(X2,X1,X3),
file('/export/starexec/sandbox2/tmp/tmp.G9bdPZtKUl/E---3.1_21762.p',cls_Message_Ostrange__Un__eq_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('/export/starexec/sandbox2/tmp/tmp.G9bdPZtKUl/E---3.1_21762.p',cls_conjecture_2) ).
cnf(c_0_15,axiom,
( c_in(X1,X4,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_ODiff__iff_2 ).
cnf(c_0_16,negated_conjecture,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_17,axiom,
( c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
cls_Message_Oanalz__subset__iff_0 ).
cnf(c_0_18,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_19,negated_conjecture,
( c_in(v_x,c_minus(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),X1,tc_set(tc_Message_Omsg)),tc_Message_Omsg)
| c_in(v_x,X1,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
( c_minus(X1,X2,tc_set(X3)) = c_emptyset
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_ODiff__eq__empty__iff_1 ).
cnf(c_0_21,axiom,
~ c_in(X1,c_emptyset,X2),
cls_Set_Oempty__iff_0 ).
cnf(c_0_22,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_23,plain,
c_lessequals(X1,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( c_in(v_x,X1,tc_Message_Omsg)
| ~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),X1,tc_set(tc_Message_Omsg)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,plain,
c_lessequals(X1,c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,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_27,axiom,
c_union(c_insert(X1,X2,X3),X4,X3) = c_insert(X1,c_union(X2,X4,X3),X3),
cls_Set_OUn__insert__left_0 ).
cnf(c_0_28,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_29,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_30,axiom,
( c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
cls_Set_Oinsert__subset_1 ).
cnf(c_0_31,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_32,negated_conjecture,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,c_union(v_H,X1,tc_Message_Omsg),tc_Message_Omsg)),tc_Message_Omsg),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]) ).
cnf(c_0_33,axiom,
c_union(X1,c_union(X2,X1,X3),X3) = c_union(X2,X1,X3),
cls_Message_Ostrange__Un__eq_0 ).
cnf(c_0_34,plain,
( X1 = c_insert(X2,X3,X4)
| ~ c_lessequals(X1,c_insert(X2,X3,X4),tc_set(X4))
| ~ c_lessequals(X3,X1,tc_set(X4))
| ~ c_in(X2,X1,X4) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_30,c_0_18]) ).
cnf(c_0_36,negated_conjecture,
( c_in(v_X,c_minus(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_set(tc_Message_Omsg)),tc_Message_Omsg)
| c_in(v_X,X1,tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_15,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,c_union(X1,v_H,tc_Message_Omsg),tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( c_insert(X1,X2,X3) = X2
| ~ c_in(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_18])]) ).
cnf(c_0_39,negated_conjecture,
( c_in(v_X,X1,tc_Message_Omsg)
| ~ c_lessequals(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_set(tc_Message_Omsg)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_20]),c_0_21]) ).
cnf(c_0_40,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_41,negated_conjecture,
~ c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
cls_conjecture_2 ).
cnf(c_0_42,negated_conjecture,
( c_in(v_x,c_Message_Oanalz(c_union(X1,v_H,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_in(v_X,c_union(X1,v_H,tc_Message_Omsg),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
c_in(v_X,c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_Message_Omsg),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.40 % Problem : SWV251-1 : TPTP v8.1.2. Released v3.2.0.
% 0.40/0.41 % Command : run_E %s %d THM
% 0.41/0.61 % Computer : n012.cluster.edu
% 0.41/0.61 % Model : x86_64 x86_64
% 0.41/0.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.41/0.61 % Memory : 8042.1875MB
% 0.41/0.61 % OS : Linux 3.10.0-693.el7.x86_64
% 0.41/0.61 % CPULimit : 2400
% 0.41/0.61 % WCLimit : 300
% 0.41/0.61 % DateTime : Tue Oct 3 03:40:05 EDT 2023
% 0.41/0.62 % CPUTime :
% 0.79/1.04 Running first-order theorem proving
% 0.79/1.04 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.G9bdPZtKUl/E---3.1_21762.p
% 89.59/12.56 # Version: 3.1pre001
% 89.59/12.56 # Preprocessing class: FMLMSMSMSSSNFFN.
% 89.59/12.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.59/12.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 89.59/12.56 # Starting new_bool_3 with 300s (1) cores
% 89.59/12.56 # Starting new_bool_1 with 300s (1) cores
% 89.59/12.56 # Starting sh5l with 300s (1) cores
% 89.59/12.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21841 completed with status 0
% 89.59/12.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 89.59/12.56 # Preprocessing class: FMLMSMSMSSSNFFN.
% 89.59/12.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.59/12.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 89.59/12.56 # No SInE strategy applied
% 89.59/12.56 # Search class: FGHSM-SMLM32-DFFFFFNN
% 89.59/12.56 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 89.59/12.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 89.59/12.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 89.59/12.56 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 89.59/12.56 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 89.59/12.56 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 89.59/12.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21849 completed with status 0
% 89.59/12.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 89.59/12.56 # Preprocessing class: FMLMSMSMSSSNFFN.
% 89.59/12.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.59/12.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 89.59/12.56 # No SInE strategy applied
% 89.59/12.56 # Search class: FGHSM-SMLM32-DFFFFFNN
% 89.59/12.56 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 89.59/12.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 89.59/12.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 89.59/12.56 # Preprocessing time : 0.027 s
% 89.59/12.56 # Presaturation interreduction done
% 89.59/12.56
% 89.59/12.56 # Proof found!
% 89.59/12.56 # SZS status Unsatisfiable
% 89.59/12.56 # SZS output start CNFRefutation
% See solution above
% 89.59/12.56 # Parsed axioms : 2831
% 89.59/12.56 # Removed by relevancy pruning/SinE : 0
% 89.59/12.56 # Initial clauses : 2831
% 89.59/12.56 # Removed in clause preprocessing : 9
% 89.59/12.56 # Initial clauses in saturation : 2822
% 89.59/12.56 # Processed clauses : 53244
% 89.59/12.56 # ...of these trivial : 643
% 89.59/12.56 # ...subsumed : 40951
% 89.59/12.56 # ...remaining for further processing : 11650
% 89.59/12.56 # Other redundant clauses eliminated : 916
% 89.59/12.56 # Clauses deleted for lack of memory : 0
% 89.59/12.56 # Backward-subsumed : 1009
% 89.59/12.56 # Backward-rewritten : 521
% 89.59/12.56 # Generated clauses : 309993
% 89.59/12.56 # ...of the previous two non-redundant : 274595
% 89.59/12.56 # ...aggressively subsumed : 0
% 89.59/12.56 # Contextual simplify-reflections : 426
% 89.59/12.56 # Paramodulations : 308979
% 89.59/12.56 # Factorizations : 21
% 89.59/12.56 # NegExts : 0
% 89.59/12.56 # Equation resolutions : 993
% 89.59/12.56 # Total rewrite steps : 251180
% 89.59/12.56 # Propositional unsat checks : 2
% 89.59/12.56 # Propositional check models : 1
% 89.59/12.56 # Propositional check unsatisfiable : 0
% 89.59/12.56 # Propositional clauses : 0
% 89.59/12.56 # Propositional clauses after purity: 0
% 89.59/12.56 # Propositional unsat core size : 0
% 89.59/12.56 # Propositional preprocessing time : 0.000
% 89.59/12.56 # Propositional encoding time : 0.459
% 89.59/12.56 # Propositional solver time : 0.306
% 89.59/12.56 # Success case prop preproc time : 0.000
% 89.59/12.56 # Success case prop encoding time : 0.000
% 89.59/12.56 # Success case prop solver time : 0.000
% 89.59/12.56 # Current number of processed clauses : 7433
% 89.59/12.56 # Positive orientable unit clauses : 1207
% 89.59/12.56 # Positive unorientable unit clauses: 17
% 89.59/12.56 # Negative unit clauses : 571
% 89.59/12.56 # Non-unit-clauses : 5638
% 89.59/12.56 # Current number of unprocessed clauses: 223956
% 89.59/12.56 # ...number of literals in the above : 692294
% 89.59/12.56 # Current number of archived formulas : 0
% 89.59/12.56 # Current number of archived clauses : 4225
% 89.59/12.56 # Clause-clause subsumption calls (NU) : 12888013
% 89.59/12.56 # Rec. Clause-clause subsumption calls : 7580706
% 89.59/12.56 # Non-unit clause-clause subsumptions : 9480
% 89.59/12.56 # Unit Clause-clause subsumption calls : 416431
% 89.59/12.56 # Rewrite failures with RHS unbound : 0
% 89.59/12.56 # BW rewrite match attempts : 4081
% 89.59/12.56 # BW rewrite match successes : 335
% 89.59/12.56 # Condensation attempts : 0
% 89.59/12.56 # Condensation successes : 0
% 89.59/12.56 # Termbank termtop insertions : 6986199
% 89.59/12.56
% 89.59/12.56 # -------------------------------------------------
% 89.59/12.56 # User time : 10.753 s
% 89.59/12.56 # System time : 0.256 s
% 89.59/12.56 # Total time : 11.009 s
% 89.59/12.56 # Maximum resident set size: 6468 pages
% 89.59/12.56
% 89.59/12.56 # -------------------------------------------------
% 89.59/12.56 # User time : 53.370 s
% 89.59/12.56 # System time : 1.465 s
% 89.59/12.56 # Total time : 54.835 s
% 89.59/12.56 # Maximum resident set size: 3536 pages
% 89.59/12.56 % E---3.1 exiting
% 89.64/12.56 % E---3.1 exiting
%------------------------------------------------------------------------------