TSTP Solution File: SEU143+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU143+1 : TPTP v8.1.2. Released v3.3.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:30:32 EDT 2023
% Result : Theorem 0.17s 0.44s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 35 ( 21 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 39 ( 18 ~; 13 |; 4 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 2 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zwpmSewPn3/E---3.1_4458.p',d1_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.zwpmSewPn3/E---3.1_4458.p',d1_tarski) ).
fof(l1_zfmisc_1,conjecture,
! [X1] : singleton(X1) != empty_set,
file('/export/starexec/sandbox/tmp/tmp.zwpmSewPn3/E---3.1_4458.p',l1_zfmisc_1) ).
fof(c_0_3,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_4,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( ~ in(X11,X10)
| X11 = X9
| X10 != singleton(X9) )
& ( X12 != X9
| in(X12,X10)
| X10 != singleton(X9) )
& ( ~ in(esk3_2(X13,X14),X14)
| esk3_2(X13,X14) != X13
| X14 = singleton(X13) )
& ( in(esk3_2(X13,X14),X14)
| esk3_2(X13,X14) = X13
| X14 = singleton(X13) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] : singleton(X1) != empty_set,
inference(assume_negation,[status(cth)],[l1_zfmisc_1]) ).
fof(c_0_6,plain,
! [X5,X6,X7] :
( ( X5 != empty_set
| ~ in(X6,X5) )
& ( in(esk2_1(X7),X7)
| X7 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_7,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
singleton(esk1_0) = empty_set,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])]) ).
cnf(c_0_11,negated_conjecture,
singleton(esk1_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SEU143+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:40:45 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.zwpmSewPn3/E---3.1_4458.p
% 0.17/0.44 # Version: 3.1pre001
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # new_bool_3 with pid 4547 completed with status 0
% 0.17/0.44 # Result found by new_bool_3
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # SAT001_MinMin_p005000_rr_RG with pid 4555 completed with status 0
% 0.17/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44 # Presaturation interreduction done
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Theorem
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 9
% 0.17/0.44 # Removed by relevancy pruning/SinE : 2
% 0.17/0.44 # Initial clauses : 11
% 0.17/0.44 # Removed in clause preprocessing : 0
% 0.17/0.44 # Initial clauses in saturation : 11
% 0.17/0.44 # Processed clauses : 24
% 0.17/0.44 # ...of these trivial : 0
% 0.17/0.44 # ...subsumed : 0
% 0.17/0.44 # ...remaining for further processing : 23
% 0.17/0.44 # Other redundant clauses eliminated : 4
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 0
% 0.17/0.44 # Backward-rewritten : 0
% 0.17/0.44 # Generated clauses : 6
% 0.17/0.44 # ...of the previous two non-redundant : 6
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 0
% 0.17/0.44 # Paramodulations : 3
% 0.17/0.44 # Factorizations : 0
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 4
% 0.17/0.44 # Total rewrite steps : 0
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 9
% 0.17/0.44 # Positive orientable unit clauses : 4
% 0.17/0.44 # Positive unorientable unit clauses: 0
% 0.17/0.44 # Negative unit clauses : 4
% 0.17/0.44 # Non-unit-clauses : 1
% 0.17/0.44 # Current number of unprocessed clauses: 4
% 0.17/0.44 # ...number of literals in the above : 10
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 11
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.44 # Non-unit clause-clause subsumptions : 0
% 0.17/0.44 # Unit Clause-clause subsumption calls : 1
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 1
% 0.17/0.44 # BW rewrite match successes : 0
% 0.17/0.44 # Condensation attempts : 0
% 0.17/0.44 # Condensation successes : 0
% 0.17/0.44 # Termbank termtop insertions : 516
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.005 s
% 0.17/0.44 # System time : 0.000 s
% 0.17/0.44 # Total time : 0.005 s
% 0.17/0.44 # Maximum resident set size: 1760 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.006 s
% 0.17/0.44 # System time : 0.001 s
% 0.17/0.44 # Total time : 0.007 s
% 0.17/0.44 # Maximum resident set size: 1680 pages
% 0.17/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------