TSTP Solution File: SEU264+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU264+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:25:56 EDT 2024
% Result : Theorem 0.22s 0.58s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 43 ( 17 ~; 13 |; 5 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 40 ( 2 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_relset_1,conjecture,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(X1,X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZoqluBeb2O/E---3.1_5220.p',t16_relset_1) ).
fof(t14_relset_1,lemma,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(relation_rng(X4),X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZoqluBeb2O/E---3.1_5220.p',t14_relset_1) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ZoqluBeb2O/E---3.1_5220.p',t1_xboole_1) ).
fof(t12_relset_1,lemma,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZoqluBeb2O/E---3.1_5220.p',t12_relset_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(X1,X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
inference(assume_negation,[status(cth)],[t16_relset_1]) ).
fof(c_0_5,lemma,
! [X20,X21,X22,X23] :
( ~ relation_of2_as_subset(X23,X22,X20)
| ~ subset(relation_rng(X23),X21)
| relation_of2_as_subset(X23,X22,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t14_relset_1])])]) ).
fof(c_0_6,negated_conjecture,
( relation_of2_as_subset(esk4_0,esk3_0,esk1_0)
& subset(esk1_0,esk2_0)
& ~ relation_of2_as_subset(esk4_0,esk3_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,lemma,
( relation_of2_as_subset(X1,X2,X4)
| ~ relation_of2_as_subset(X1,X2,X3)
| ~ subset(relation_rng(X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
relation_of2_as_subset(esk4_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,lemma,
! [X33,X34,X35] :
( ~ subset(X33,X34)
| ~ subset(X34,X35)
| subset(X33,X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_10,lemma,
! [X17,X18,X19] :
( ( subset(relation_dom(X19),X17)
| ~ relation_of2_as_subset(X19,X17,X18) )
& ( subset(relation_rng(X19),X18)
| ~ relation_of2_as_subset(X19,X17,X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_relset_1])])])]) ).
cnf(c_0_11,negated_conjecture,
~ relation_of2_as_subset(esk4_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( relation_of2_as_subset(esk4_0,esk3_0,X1)
| ~ subset(relation_rng(esk4_0),X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,lemma,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,lemma,
( subset(relation_rng(X1),X2)
| ~ relation_of2_as_subset(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ subset(relation_rng(esk4_0),esk2_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( subset(X1,esk2_0)
| ~ subset(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
subset(relation_rng(esk4_0),esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
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.10/0.14 % Problem : SEU264+2 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.16 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n005.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 08:02:41 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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.ZoqluBeb2O/E---3.1_5220.p
% 0.22/0.57 # Version: 3.1.0
% 0.22/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.57 # Starting sh5l with 300s (1) cores
% 0.22/0.57 # new_bool_1 with pid 5300 completed with status 0
% 0.22/0.57 # Result found by new_bool_1
% 0.22/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.57 # Search class: FGHSM-FFLM32-SFFFFFNN
% 0.22/0.57 # partial match(1): FGHSM-FFMM32-SFFFFFNN
% 0.22/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.57 # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 0.22/0.57 # G-E--_301_C18_F1_URBAN_S0Y with pid 5303 completed with status 0
% 0.22/0.57 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.22/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.58 # Search class: FGHSM-FFLM32-SFFFFFNN
% 0.22/0.58 # partial match(1): FGHSM-FFMM32-SFFFFFNN
% 0.22/0.58 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.58 # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 0.22/0.58 # Preprocessing time : 0.004 s
% 0.22/0.58
% 0.22/0.58 # Proof found!
% 0.22/0.58 # SZS status Theorem
% 0.22/0.58 # SZS output start CNFRefutation
% See solution above
% 0.22/0.58 # Parsed axioms : 331
% 0.22/0.58 # Removed by relevancy pruning/SinE : 245
% 0.22/0.58 # Initial clauses : 156
% 0.22/0.58 # Removed in clause preprocessing : 2
% 0.22/0.58 # Initial clauses in saturation : 154
% 0.22/0.58 # Processed clauses : 205
% 0.22/0.58 # ...of these trivial : 3
% 0.22/0.58 # ...subsumed : 23
% 0.22/0.58 # ...remaining for further processing : 179
% 0.22/0.58 # Other redundant clauses eliminated : 8
% 0.22/0.58 # Clauses deleted for lack of memory : 0
% 0.22/0.58 # Backward-subsumed : 0
% 0.22/0.58 # Backward-rewritten : 9
% 0.22/0.58 # Generated clauses : 837
% 0.22/0.58 # ...of the previous two non-redundant : 742
% 0.22/0.58 # ...aggressively subsumed : 0
% 0.22/0.58 # Contextual simplify-reflections : 1
% 0.22/0.58 # Paramodulations : 814
% 0.22/0.58 # Factorizations : 6
% 0.22/0.58 # NegExts : 0
% 0.22/0.58 # Equation resolutions : 17
% 0.22/0.58 # Disequality decompositions : 0
% 0.22/0.58 # Total rewrite steps : 104
% 0.22/0.58 # ...of those cached : 76
% 0.22/0.58 # Propositional unsat checks : 0
% 0.22/0.58 # Propositional check models : 0
% 0.22/0.58 # Propositional check unsatisfiable : 0
% 0.22/0.58 # Propositional clauses : 0
% 0.22/0.58 # Propositional clauses after purity: 0
% 0.22/0.58 # Propositional unsat core size : 0
% 0.22/0.58 # Propositional preprocessing time : 0.000
% 0.22/0.58 # Propositional encoding time : 0.000
% 0.22/0.58 # Propositional solver time : 0.000
% 0.22/0.58 # Success case prop preproc time : 0.000
% 0.22/0.58 # Success case prop encoding time : 0.000
% 0.22/0.58 # Success case prop solver time : 0.000
% 0.22/0.58 # Current number of processed clauses : 168
% 0.22/0.58 # Positive orientable unit clauses : 25
% 0.22/0.58 # Positive unorientable unit clauses: 1
% 0.22/0.58 # Negative unit clauses : 7
% 0.22/0.58 # Non-unit-clauses : 135
% 0.22/0.58 # Current number of unprocessed clauses: 684
% 0.22/0.58 # ...number of literals in the above : 2478
% 0.22/0.58 # Current number of archived formulas : 0
% 0.22/0.58 # Current number of archived clauses : 9
% 0.22/0.58 # Clause-clause subsumption calls (NU) : 1816
% 0.22/0.58 # Rec. Clause-clause subsumption calls : 1186
% 0.22/0.58 # Non-unit clause-clause subsumptions : 20
% 0.22/0.58 # Unit Clause-clause subsumption calls : 132
% 0.22/0.58 # Rewrite failures with RHS unbound : 0
% 0.22/0.58 # BW rewrite match attempts : 18
% 0.22/0.58 # BW rewrite match successes : 10
% 0.22/0.58 # Condensation attempts : 0
% 0.22/0.58 # Condensation successes : 0
% 0.22/0.58 # Termbank termtop insertions : 22176
% 0.22/0.58 # Search garbage collected termcells : 4174
% 0.22/0.58
% 0.22/0.58 # -------------------------------------------------
% 0.22/0.58 # User time : 0.036 s
% 0.22/0.58 # System time : 0.005 s
% 0.22/0.58 # Total time : 0.041 s
% 0.22/0.58 # Maximum resident set size: 2552 pages
% 0.22/0.58
% 0.22/0.58 # -------------------------------------------------
% 0.22/0.58 # User time : 0.046 s
% 0.22/0.58 # System time : 0.006 s
% 0.22/0.58 # Total time : 0.052 s
% 0.22/0.58 # Maximum resident set size: 2060 pages
% 0.22/0.58 % E---3.1 exiting
% 0.22/0.58 % E exiting
%------------------------------------------------------------------------------