TSTP Solution File: SET925+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET925+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:21:19 EDT 2023
% Result : Theorem 0.11s 0.40s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 3 unt; 0 def)
% Number of atoms : 25 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 23 ( 10 ~; 8 |; 2 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn; 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t68_zfmisc_1,conjecture,
! [X1,X2] :
( set_difference(singleton(X1),X2) = empty_set
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.tDlqisQs2h/E---3.1_29144.p',t68_zfmisc_1) ).
fof(l36_zfmisc_1,axiom,
! [X1,X2] :
( set_difference(singleton(X1),X2) = empty_set
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.tDlqisQs2h/E---3.1_29144.p',l36_zfmisc_1) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( set_difference(singleton(X1),X2) = empty_set
<=> in(X1,X2) ),
inference(assume_negation,[status(cth)],[t68_zfmisc_1]) ).
fof(c_0_3,plain,
! [X7,X8] :
( ( set_difference(singleton(X7),X8) != empty_set
| in(X7,X8) )
& ( ~ in(X7,X8)
| set_difference(singleton(X7),X8) = empty_set ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l36_zfmisc_1])]) ).
fof(c_0_4,negated_conjecture,
( ( set_difference(singleton(esk1_0),esk2_0) != empty_set
| ~ in(esk1_0,esk2_0) )
& ( set_difference(singleton(esk1_0),esk2_0) = empty_set
| in(esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( in(X1,X2)
| set_difference(singleton(X1),X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( set_difference(singleton(esk1_0),esk2_0) = empty_set
| in(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( set_difference(singleton(esk1_0),esk2_0) != empty_set
| ~ in(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
in(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
set_difference(singleton(esk1_0),esk2_0) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_10,plain,
( set_difference(singleton(X1),X2) = empty_set
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SET925+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.08/0.26 % Computer : n026.cluster.edu
% 0.08/0.26 % Model : x86_64 x86_64
% 0.08/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26 % Memory : 8042.1875MB
% 0.08/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26 % CPULimit : 2400
% 0.08/0.26 % WCLimit : 300
% 0.08/0.26 % DateTime : Mon Oct 2 18:00:44 EDT 2023
% 0.08/0.27 % CPUTime :
% 0.11/0.39 Running first-order theorem proving
% 0.11/0.39 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.tDlqisQs2h/E---3.1_29144.p
% 0.11/0.40 # Version: 3.1pre001
% 0.11/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.40 # Starting sh5l with 300s (1) cores
% 0.11/0.40 # new_bool_1 with pid 29305 completed with status 0
% 0.11/0.40 # Result found by new_bool_1
% 0.11/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.40 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.11/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.11/0.40 # SAT001_MinMin_p005000_rr_RG with pid 29314 completed with status 0
% 0.11/0.40 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.11/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.40 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.11/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.11/0.40 # Preprocessing time : 0.001 s
% 0.11/0.40 # Presaturation interreduction done
% 0.11/0.40
% 0.11/0.40 # Proof found!
% 0.11/0.40 # SZS status Theorem
% 0.11/0.40 # SZS output start CNFRefutation
% See solution above
% 0.11/0.40 # Parsed axioms : 6
% 0.11/0.40 # Removed by relevancy pruning/SinE : 0
% 0.11/0.40 # Initial clauses : 8
% 0.11/0.40 # Removed in clause preprocessing : 0
% 0.11/0.40 # Initial clauses in saturation : 8
% 0.11/0.40 # Processed clauses : 19
% 0.11/0.40 # ...of these trivial : 0
% 0.11/0.40 # ...subsumed : 0
% 0.11/0.40 # ...remaining for further processing : 19
% 0.11/0.40 # Other redundant clauses eliminated : 0
% 0.11/0.40 # Clauses deleted for lack of memory : 0
% 0.11/0.40 # Backward-subsumed : 0
% 0.11/0.40 # Backward-rewritten : 2
% 0.11/0.40 # Generated clauses : 5
% 0.11/0.40 # ...of the previous two non-redundant : 3
% 0.11/0.40 # ...aggressively subsumed : 0
% 0.11/0.40 # Contextual simplify-reflections : 0
% 0.11/0.40 # Paramodulations : 5
% 0.11/0.40 # Factorizations : 0
% 0.11/0.40 # NegExts : 0
% 0.11/0.40 # Equation resolutions : 0
% 0.11/0.40 # Total rewrite steps : 3
% 0.11/0.40 # Propositional unsat checks : 0
% 0.11/0.40 # Propositional check models : 0
% 0.11/0.40 # Propositional check unsatisfiable : 0
% 0.11/0.40 # Propositional clauses : 0
% 0.11/0.40 # Propositional clauses after purity: 0
% 0.11/0.40 # Propositional unsat core size : 0
% 0.11/0.40 # Propositional preprocessing time : 0.000
% 0.11/0.40 # Propositional encoding time : 0.000
% 0.11/0.40 # Propositional solver time : 0.000
% 0.11/0.40 # Success case prop preproc time : 0.000
% 0.11/0.40 # Success case prop encoding time : 0.000
% 0.11/0.40 # Success case prop solver time : 0.000
% 0.11/0.40 # Current number of processed clauses : 9
% 0.11/0.40 # Positive orientable unit clauses : 3
% 0.11/0.40 # Positive unorientable unit clauses: 0
% 0.11/0.40 # Negative unit clauses : 3
% 0.11/0.40 # Non-unit-clauses : 3
% 0.11/0.40 # Current number of unprocessed clauses: 0
% 0.11/0.40 # ...number of literals in the above : 0
% 0.11/0.40 # Current number of archived formulas : 0
% 0.11/0.40 # Current number of archived clauses : 10
% 0.11/0.40 # Clause-clause subsumption calls (NU) : 0
% 0.11/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.11/0.40 # Non-unit clause-clause subsumptions : 0
% 0.11/0.40 # Unit Clause-clause subsumption calls : 1
% 0.11/0.40 # Rewrite failures with RHS unbound : 0
% 0.11/0.40 # BW rewrite match attempts : 1
% 0.11/0.40 # BW rewrite match successes : 1
% 0.11/0.40 # Condensation attempts : 0
% 0.11/0.40 # Condensation successes : 0
% 0.11/0.40 # Termbank termtop insertions : 395
% 0.11/0.40
% 0.11/0.40 # -------------------------------------------------
% 0.11/0.40 # User time : 0.003 s
% 0.11/0.40 # System time : 0.003 s
% 0.11/0.40 # Total time : 0.006 s
% 0.11/0.40 # Maximum resident set size: 1768 pages
% 0.11/0.40
% 0.11/0.40 # -------------------------------------------------
% 0.11/0.40 # User time : 0.003 s
% 0.11/0.40 # System time : 0.006 s
% 0.11/0.40 # Total time : 0.009 s
% 0.11/0.40 # Maximum resident set size: 1672 pages
% 0.11/0.40 % E---3.1 exiting
% 0.29/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------