TSTP Solution File: SWV273-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV273-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Sat May 4 09:43:27 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 10 unt; 0 nHn; 15 RR)
% Number of literals : 33 ( 0 equ; 18 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 : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 31 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/tmp/tmp.o1EaSoUYJi/E---3.1_21653.p',cls_conjecture_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/sandbox/tmp/tmp.o1EaSoUYJi/E---3.1_21653.p',cls_Set_OUn__subset__iff_2) ).
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/sandbox/tmp/tmp.o1EaSoUYJi/E---3.1_21653.p',cls_Message_Oparts__subset__iff_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox/tmp/tmp.o1EaSoUYJi/E---3.1_21653.p',cls_Set_Osubset__refl_0) ).
cnf(cls_Message_Oparts__mono_0,axiom,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/tmp/tmp.o1EaSoUYJi/E---3.1_21653.p',cls_Message_Oparts__mono_0) ).
cnf(cls_Message_Osynth__increasing_0,axiom,
c_lessequals(X1,c_Message_Osynth(X1),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/tmp/tmp.o1EaSoUYJi/E---3.1_21653.p',cls_Message_Osynth__increasing_0) ).
cnf(c_0_6,negated_conjecture,
~ c_lessequals(c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_7,plain,
( 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)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_2]) ).
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_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
c_0_6 ).
cnf(c_0_10,plain,
( 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)) ),
c_0_7 ).
cnf(c_0_11,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_12,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_13,negated_conjecture,
( ~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Osynth(v_H),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
c_lessequals(X1,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__mono_0]) ).
cnf(c_0_16,negated_conjecture,
~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_17,plain,
( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
c_0_15 ).
cnf(c_0_18,axiom,
c_lessequals(X1,c_Message_Osynth(X1),tc_set(tc_Message_Omsg)),
cls_Message_Osynth__increasing_0 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV273-2 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 17:14:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.o1EaSoUYJi/E---3.1_21653.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 21733 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FHUNS-FFSF31-SFFFFFNN
% 0.20/0.49 # partial match(1): FHUNS-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.49 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 21737 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FHUNS-FFSF31-SFFFFFNN
% 0.20/0.49 # partial match(1): FHUNS-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 6
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 6
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 6
% 0.20/0.49 # Processed clauses : 15
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 15
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 5
% 0.20/0.49 # ...of the previous two non-redundant : 5
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 5
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 2
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 8
% 0.20/0.49 # Positive orientable unit clauses : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 3
% 0.20/0.49 # Current number of unprocessed clauses: 2
% 0.20/0.49 # ...number of literals in the above : 3
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 7
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 2
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 3
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 5
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 294
% 0.20/0.49 # Search garbage collected termcells : 13
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.004 s
% 0.20/0.49 # Maximum resident set size: 1628 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1692 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------