TSTP Solution File: SET867+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET867+1 : TPTP v8.1.2. Released v3.2.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:24:16 EDT 2023
% Result : Theorem 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 47 ( 17 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 55 ( 23 ~; 21 |; 7 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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; 1 con; 0-3 aty)
% Number of variables : 29 ( 3 sgn; 18 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.TnzJJ6RPDp/E---3.1_12056.p',d1_xboole_0) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TnzJJ6RPDp/E---3.1_12056.p',d4_tarski) ).
fof(t2_zfmisc_1,conjecture,
union(empty_set) = empty_set,
file('/export/starexec/sandbox/tmp/tmp.TnzJJ6RPDp/E---3.1_12056.p',t2_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,
! [X5,X6,X7] :
( ( X5 != empty_set
| ~ in(X6,X5) )
& ( in(esk1_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])])])])]) ).
fof(c_0_5,plain,
! [X9,X10,X11,X13,X14,X15,X16,X18] :
( ( in(X11,esk2_3(X9,X10,X11))
| ~ in(X11,X10)
| X10 != union(X9) )
& ( in(esk2_3(X9,X10,X11),X9)
| ~ in(X11,X10)
| X10 != union(X9) )
& ( ~ in(X13,X14)
| ~ in(X14,X9)
| in(X13,X10)
| X10 != union(X9) )
& ( ~ in(esk3_2(X15,X16),X16)
| ~ in(esk3_2(X15,X16),X18)
| ~ in(X18,X15)
| X16 = union(X15) )
& ( in(esk3_2(X15,X16),esk4_2(X15,X16))
| in(esk3_2(X15,X16),X16)
| X16 = union(X15) )
& ( in(esk4_2(X15,X16),X15)
| in(esk3_2(X15,X16),X16)
| X16 = union(X15) ) ),
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)],[d4_tarski])])])])])]) ).
cnf(c_0_6,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( in(esk2_3(X1,X2,X3),X1)
| ~ in(X3,X2)
| X2 != union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( in(esk2_3(X1,union(X1),X2),X1)
| ~ in(X2,union(X1)) ),
inference(er,[status(thm)],[c_0_7]) ).
fof(c_0_10,negated_conjecture,
union(empty_set) != empty_set,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t2_zfmisc_1])]) ).
cnf(c_0_11,plain,
~ in(X1,union(empty_set)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( in(esk1_1(X1),X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
union(empty_set) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET867+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 17:34:34 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.TnzJJ6RPDp/E---3.1_12056.p
% 0.22/0.50 # Version: 3.1pre001
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # new_bool_3 with pid 12160 completed with status 0
% 0.22/0.50 # Result found by new_bool_3
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50 # Search class: FGHSF-FFSF31-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50 # SAT001_MinMin_p005000_rr_RG with pid 12163 completed with status 0
% 0.22/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50 # Search class: FGHSF-FFSF31-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Theorem
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 7
% 0.22/0.50 # Removed by relevancy pruning/SinE : 0
% 0.22/0.50 # Initial clauses : 13
% 0.22/0.50 # Removed in clause preprocessing : 0
% 0.22/0.50 # Initial clauses in saturation : 13
% 0.22/0.50 # Processed clauses : 33
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 0
% 0.22/0.50 # ...remaining for further processing : 33
% 0.22/0.50 # Other redundant clauses eliminated : 4
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 0
% 0.22/0.50 # Generated clauses : 17
% 0.22/0.50 # ...of the previous two non-redundant : 16
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 0
% 0.22/0.50 # Paramodulations : 13
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 4
% 0.22/0.50 # Total rewrite steps : 0
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 16
% 0.22/0.50 # Positive orientable unit clauses : 2
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 5
% 0.22/0.50 # Non-unit-clauses : 9
% 0.22/0.50 # Current number of unprocessed clauses: 8
% 0.22/0.50 # ...number of literals in the above : 24
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 13
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 42
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 40
% 0.22/0.50 # Non-unit clause-clause subsumptions : 0
% 0.22/0.50 # Unit Clause-clause subsumption calls : 3
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 0
% 0.22/0.50 # BW rewrite match successes : 0
% 0.22/0.50 # Condensation attempts : 0
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 915
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.004 s
% 0.22/0.50 # System time : 0.003 s
% 0.22/0.50 # Total time : 0.007 s
% 0.22/0.50 # Maximum resident set size: 1700 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.005 s
% 0.22/0.50 # System time : 0.006 s
% 0.22/0.50 # Total time : 0.011 s
% 0.22/0.50 # Maximum resident set size: 1676 pages
% 0.22/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------