TSTP Solution File: SEU160+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU160+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:25:01 EDT 2023
% Result : Theorem 0.21s 0.56s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 43 ( 23 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 38 ( 13 ~; 18 |; 4 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 17 ( 2 sgn; 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t39_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mjrQI2mfht/E---3.1_10942.p',t39_zfmisc_1) ).
fof(l4_zfmisc_1,lemma,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mjrQI2mfht/E---3.1_10942.p',l4_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.mjrQI2mfht/E---3.1_10942.p',reflexivity_r1_tarski) ).
fof(t2_xboole_1,lemma,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox2/tmp/tmp.mjrQI2mfht/E---3.1_10942.p',t2_xboole_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
inference(assume_negation,[status(cth)],[t39_zfmisc_1]) ).
fof(c_0_5,lemma,
! [X24,X25] :
( ( ~ subset(X24,singleton(X25))
| X24 = empty_set
| X24 = singleton(X25) )
& ( X24 != empty_set
| subset(X24,singleton(X25)) )
& ( X24 != singleton(X25)
| subset(X24,singleton(X25)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l4_zfmisc_1])])]) ).
fof(c_0_6,negated_conjecture,
( ( esk1_0 != empty_set
| ~ subset(esk1_0,singleton(esk2_0)) )
& ( esk1_0 != singleton(esk2_0)
| ~ subset(esk1_0,singleton(esk2_0)) )
& ( subset(esk1_0,singleton(esk2_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,lemma,
( X1 = empty_set
| X1 = singleton(X2)
| ~ subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( subset(esk1_0,singleton(esk2_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X52] : subset(X52,X52),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_10,negated_conjecture,
( esk1_0 != singleton(esk2_0)
| ~ subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( singleton(esk2_0) = esk1_0
| esk1_0 = empty_set ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,lemma,
! [X38] : subset(empty_set,X38),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_14,negated_conjecture,
( esk1_0 != empty_set
| ~ subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_16,lemma,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEU160+2 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n014.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 08:13:20 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.53 Running first-order theorem proving
% 0.21/0.53 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.mjrQI2mfht/E---3.1_10942.p
% 0.21/0.56 # Version: 3.1pre001
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # new_bool_1 with pid 11065 completed with status 0
% 0.21/0.56 # Result found by new_bool_1
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.21/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.21/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 11067 completed with status 0
% 0.21/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.21/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.21/0.56 # Preprocessing time : 0.002 s
% 0.21/0.56 # Presaturation interreduction done
% 0.21/0.56
% 0.21/0.56 # Proof found!
% 0.21/0.56 # SZS status Theorem
% 0.21/0.56 # SZS output start CNFRefutation
% See solution above
% 0.21/0.56 # Parsed axioms : 90
% 0.21/0.56 # Removed by relevancy pruning/SinE : 30
% 0.21/0.56 # Initial clauses : 97
% 0.21/0.56 # Removed in clause preprocessing : 0
% 0.21/0.56 # Initial clauses in saturation : 97
% 0.21/0.56 # Processed clauses : 206
% 0.21/0.56 # ...of these trivial : 2
% 0.21/0.56 # ...subsumed : 27
% 0.21/0.56 # ...remaining for further processing : 177
% 0.21/0.56 # Other redundant clauses eliminated : 20
% 0.21/0.56 # Clauses deleted for lack of memory : 0
% 0.21/0.56 # Backward-subsumed : 5
% 0.21/0.56 # Backward-rewritten : 6
% 0.21/0.56 # Generated clauses : 177
% 0.21/0.56 # ...of the previous two non-redundant : 109
% 0.21/0.56 # ...aggressively subsumed : 0
% 0.21/0.56 # Contextual simplify-reflections : 0
% 0.21/0.56 # Paramodulations : 158
% 0.21/0.56 # Factorizations : 0
% 0.21/0.56 # NegExts : 0
% 0.21/0.56 # Equation resolutions : 20
% 0.21/0.56 # Total rewrite steps : 87
% 0.21/0.56 # Propositional unsat checks : 0
% 0.21/0.56 # Propositional check models : 0
% 0.21/0.56 # Propositional check unsatisfiable : 0
% 0.21/0.56 # Propositional clauses : 0
% 0.21/0.56 # Propositional clauses after purity: 0
% 0.21/0.56 # Propositional unsat core size : 0
% 0.21/0.56 # Propositional preprocessing time : 0.000
% 0.21/0.56 # Propositional encoding time : 0.000
% 0.21/0.56 # Propositional solver time : 0.000
% 0.21/0.56 # Success case prop preproc time : 0.000
% 0.21/0.56 # Success case prop encoding time : 0.000
% 0.21/0.56 # Success case prop solver time : 0.000
% 0.21/0.56 # Current number of processed clauses : 62
% 0.21/0.56 # Positive orientable unit clauses : 24
% 0.21/0.56 # Positive unorientable unit clauses: 2
% 0.21/0.56 # Negative unit clauses : 6
% 0.21/0.56 # Non-unit-clauses : 30
% 0.21/0.56 # Current number of unprocessed clauses: 87
% 0.21/0.56 # ...number of literals in the above : 184
% 0.21/0.56 # Current number of archived formulas : 0
% 0.21/0.56 # Current number of archived clauses : 99
% 0.21/0.56 # Clause-clause subsumption calls (NU) : 489
% 0.21/0.56 # Rec. Clause-clause subsumption calls : 341
% 0.21/0.56 # Non-unit clause-clause subsumptions : 20
% 0.21/0.56 # Unit Clause-clause subsumption calls : 25
% 0.21/0.56 # Rewrite failures with RHS unbound : 0
% 0.21/0.56 # BW rewrite match attempts : 64
% 0.21/0.56 # BW rewrite match successes : 43
% 0.21/0.56 # Condensation attempts : 0
% 0.21/0.56 # Condensation successes : 0
% 0.21/0.56 # Termbank termtop insertions : 6524
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.012 s
% 0.21/0.56 # System time : 0.005 s
% 0.21/0.56 # Total time : 0.017 s
% 0.21/0.56 # Maximum resident set size: 2056 pages
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.015 s
% 0.21/0.56 # System time : 0.007 s
% 0.21/0.56 # Total time : 0.022 s
% 0.21/0.56 # Maximum resident set size: 1748 pages
% 0.21/0.56 % E---3.1 exiting
% 0.21/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------