TSTP Solution File: SEU160+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU160+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 45 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 41 ( 15 ~; 19 |; 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 : 18 ( 4 sgn; 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t39_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.Hi1xmhGc0x/E---3.1_5007.p',t39_zfmisc_1) ).
fof(l4_zfmisc_1,axiom,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.Hi1xmhGc0x/E---3.1_5007.p',l4_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.Hi1xmhGc0x/E---3.1_5007.p',reflexivity_r1_tarski) ).
fof(c_0_3,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_4,plain,
! [X5,X6] :
( ( ~ subset(X5,singleton(X6))
| X5 = empty_set
| X5 = singleton(X6) )
& ( X5 != empty_set
| subset(X5,singleton(X6)) )
& ( X5 != singleton(X6)
| subset(X5,singleton(X6)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l4_zfmisc_1])])]) ).
fof(c_0_5,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_3])])])]) ).
cnf(c_0_6,plain,
( X1 = empty_set
| X1 = singleton(X2)
| ~ subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( subset(esk1_0,singleton(esk2_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X7] : subset(X7,X7),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_9,negated_conjecture,
( esk1_0 != singleton(esk2_0)
| ~ subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( singleton(esk2_0) = esk1_0
| empty_set = esk1_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( subset(X1,singleton(X2))
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( esk1_0 != empty_set
| ~ subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
empty_set = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,plain,
subset(empty_set,singleton(X1)),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ subset(esk1_0,singleton(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_17,plain,
subset(esk1_0,singleton(X1)),
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU160+3 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n015.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 08:47:45 EDT 2023
% 0.21/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/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.Hi1xmhGc0x/E---3.1_5007.p
% 0.21/0.49 # Version: 3.1pre001
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # new_bool_3 with pid 5116 completed with status 0
% 0.21/0.49 # Result found by new_bool_3
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHSF-FFSS11-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # SAT001_MinMin_p005000_rr_RG with pid 5121 completed with status 0
% 0.21/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHSF-FFSS11-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 6
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 10
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 10
% 0.21/0.49 # Processed clauses : 25
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 25
% 0.21/0.49 # Other redundant clauses eliminated : 2
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 2
% 0.21/0.49 # Backward-rewritten : 6
% 0.21/0.49 # Generated clauses : 9
% 0.21/0.49 # ...of the previous two non-redundant : 9
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 7
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 2
% 0.21/0.49 # Total rewrite steps : 9
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 6
% 0.21/0.49 # Positive orientable unit clauses : 5
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 1
% 0.21/0.49 # Non-unit-clauses : 0
% 0.21/0.49 # Current number of unprocessed clauses: 2
% 0.21/0.49 # ...number of literals in the above : 7
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 17
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 1
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 1
% 0.21/0.49 # Non-unit clause-clause subsumptions : 1
% 0.21/0.49 # Unit Clause-clause subsumption calls : 5
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 5
% 0.21/0.49 # BW rewrite match successes : 2
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 459
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.003 s
% 0.21/0.49 # System time : 0.003 s
% 0.21/0.49 # Total time : 0.006 s
% 0.21/0.49 # Maximum resident set size: 1744 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.003 s
% 0.21/0.49 # System time : 0.006 s
% 0.21/0.49 # Total time : 0.009 s
% 0.21/0.49 # Maximum resident set size: 1672 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------