TSTP Solution File: SET880+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET880+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : Tue May 21 03:00:17 EDT 2024
% Result : Theorem 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 38 ( 25 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 39 ( 15 ~; 14 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_zfmisc_1,conjecture,
! [X1,X2] :
( set_difference(singleton(X1),singleton(X2)) = empty_set
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(l36_zfmisc_1,axiom,
! [X1,X2] :
( set_difference(singleton(X1),X2) = empty_set
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l36_zfmisc_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( set_difference(singleton(X1),singleton(X2)) = empty_set
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t21_zfmisc_1]) ).
fof(c_0_4,plain,
! [X8,X9,X10,X11,X12,X13] :
( ( ~ in(X10,X9)
| X10 = X8
| X9 != singleton(X8) )
& ( X11 != X8
| in(X11,X9)
| X9 != singleton(X8) )
& ( ~ in(esk3_2(X12,X13),X13)
| esk3_2(X12,X13) != X12
| X13 = singleton(X12) )
& ( in(esk3_2(X12,X13),X13)
| esk3_2(X12,X13) = X12
| X13 = singleton(X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,plain,
! [X6,X7] :
( ( set_difference(singleton(X6),X7) != empty_set
| in(X6,X7) )
& ( ~ in(X6,X7)
| set_difference(singleton(X6),X7) = empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l36_zfmisc_1])])]) ).
fof(c_0_6,negated_conjecture,
( set_difference(singleton(esk1_0),singleton(esk2_0)) = empty_set
& esk1_0 != esk2_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_7,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( in(X1,X2)
| set_difference(singleton(X1),X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
set_difference(singleton(esk1_0),singleton(esk2_0)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
in(esk1_0,singleton(esk2_0)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
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.06/0.12 % Problem : SET880+1 : TPTP v8.2.0. Released v3.2.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 11:47:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Version: 3.1.0
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.47 # Starting sh5l with 300s (1) cores
% 0.20/0.47 # new_bool_3 with pid 1806 completed with status 0
% 0.20/0.47 # Result found by new_bool_3
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.47 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.20/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.47 # SAT001_MinMin_p005000_rr_RG with pid 1809 completed with status 0
% 0.20/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.47 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.20/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.47 # Preprocessing time : 0.001 s
% 0.20/0.47 # Presaturation interreduction done
% 0.20/0.47
% 0.20/0.47 # Proof found!
% 0.20/0.47 # SZS status Theorem
% 0.20/0.47 # SZS output start CNFRefutation
% See solution above
% 0.20/0.47 # Parsed axioms : 7
% 0.20/0.47 # Removed by relevancy pruning/SinE : 0
% 0.20/0.47 # Initial clauses : 12
% 0.20/0.47 # Removed in clause preprocessing : 0
% 0.20/0.47 # Initial clauses in saturation : 12
% 0.20/0.47 # Processed clauses : 26
% 0.20/0.47 # ...of these trivial : 0
% 0.20/0.47 # ...subsumed : 0
% 0.20/0.47 # ...remaining for further processing : 26
% 0.20/0.47 # Other redundant clauses eliminated : 3
% 0.20/0.47 # Clauses deleted for lack of memory : 0
% 0.20/0.47 # Backward-subsumed : 0
% 0.20/0.47 # Backward-rewritten : 0
% 0.20/0.47 # Generated clauses : 7
% 0.20/0.47 # ...of the previous two non-redundant : 5
% 0.20/0.47 # ...aggressively subsumed : 0
% 0.20/0.47 # Contextual simplify-reflections : 0
% 0.20/0.47 # Paramodulations : 5
% 0.20/0.47 # Factorizations : 0
% 0.20/0.47 # NegExts : 0
% 0.20/0.47 # Equation resolutions : 3
% 0.20/0.47 # Disequality decompositions : 0
% 0.20/0.47 # Total rewrite steps : 0
% 0.20/0.47 # ...of those cached : 0
% 0.20/0.47 # Propositional unsat checks : 0
% 0.20/0.47 # Propositional check models : 0
% 0.20/0.47 # Propositional check unsatisfiable : 0
% 0.20/0.47 # Propositional clauses : 0
% 0.20/0.47 # Propositional clauses after purity: 0
% 0.20/0.47 # Propositional unsat core size : 0
% 0.20/0.47 # Propositional preprocessing time : 0.000
% 0.20/0.47 # Propositional encoding time : 0.000
% 0.20/0.47 # Propositional solver time : 0.000
% 0.20/0.47 # Success case prop preproc time : 0.000
% 0.20/0.47 # Success case prop encoding time : 0.000
% 0.20/0.47 # Success case prop solver time : 0.000
% 0.20/0.47 # Current number of processed clauses : 12
% 0.20/0.47 # Positive orientable unit clauses : 5
% 0.20/0.47 # Positive unorientable unit clauses: 0
% 0.20/0.47 # Negative unit clauses : 3
% 0.20/0.47 # Non-unit-clauses : 4
% 0.20/0.47 # Current number of unprocessed clauses: 2
% 0.20/0.47 # ...number of literals in the above : 6
% 0.20/0.47 # Current number of archived formulas : 0
% 0.20/0.47 # Current number of archived clauses : 12
% 0.20/0.47 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.47 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.47 # Non-unit clause-clause subsumptions : 0
% 0.20/0.47 # Unit Clause-clause subsumption calls : 1
% 0.20/0.47 # Rewrite failures with RHS unbound : 0
% 0.20/0.47 # BW rewrite match attempts : 1
% 0.20/0.47 # BW rewrite match successes : 0
% 0.20/0.47 # Condensation attempts : 0
% 0.20/0.47 # Condensation successes : 0
% 0.20/0.47 # Termbank termtop insertions : 675
% 0.20/0.47 # Search garbage collected termcells : 182
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.005 s
% 0.20/0.47 # System time : 0.002 s
% 0.20/0.47 # Total time : 0.007 s
% 0.20/0.47 # Maximum resident set size: 1744 pages
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.007 s
% 0.20/0.47 # System time : 0.002 s
% 0.20/0.47 # Total time : 0.010 s
% 0.20/0.47 # Maximum resident set size: 1696 pages
% 0.20/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------