TSTP Solution File: SET881+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET881+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:12 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 7 unt; 0 def)
% Number of atoms : 42 ( 28 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 47 ( 18 ~; 20 |; 6 &)
% ( 3 <=>; 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 30 ( 3 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hdICZPI6gQ/E---3.1_8381.p',d2_tarski) ).
fof(t22_zfmisc_1,conjecture,
! [X1,X2] : set_difference(singleton(X1),unordered_pair(X1,X2)) = empty_set,
file('/export/starexec/sandbox/tmp/tmp.hdICZPI6gQ/E---3.1_8381.p',t22_zfmisc_1) ).
fof(l36_zfmisc_1,axiom,
! [X1,X2] :
( set_difference(singleton(X1),X2) = empty_set
<=> in(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.hdICZPI6gQ/E---3.1_8381.p',l36_zfmisc_1) ).
fof(c_0_3,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( ~ in(X12,X11)
| X12 = X9
| X12 = X10
| X11 != unordered_pair(X9,X10) )
& ( X13 != X9
| in(X13,X11)
| X11 != unordered_pair(X9,X10) )
& ( X13 != X10
| in(X13,X11)
| X11 != unordered_pair(X9,X10) )
& ( esk1_3(X14,X15,X16) != X14
| ~ in(esk1_3(X14,X15,X16),X16)
| X16 = unordered_pair(X14,X15) )
& ( esk1_3(X14,X15,X16) != X15
| ~ in(esk1_3(X14,X15,X16),X16)
| X16 = unordered_pair(X14,X15) )
& ( in(esk1_3(X14,X15,X16),X16)
| esk1_3(X14,X15,X16) = X14
| esk1_3(X14,X15,X16) = X15
| X16 = unordered_pair(X14,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)],[d2_tarski])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] : set_difference(singleton(X1),unordered_pair(X1,X2)) = empty_set,
inference(assume_negation,[status(cth)],[t22_zfmisc_1]) ).
fof(c_0_5,plain,
! [X18,X19] :
( ( set_difference(singleton(X18),X19) != empty_set
| in(X18,X19) )
& ( ~ in(X18,X19)
| set_difference(singleton(X18),X19) = empty_set ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l36_zfmisc_1])]) ).
cnf(c_0_6,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_7,negated_conjecture,
set_difference(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)) != empty_set,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,plain,
( set_difference(singleton(X1),X2) = empty_set
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]) ).
cnf(c_0_10,negated_conjecture,
set_difference(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
set_difference(singleton(X1),unordered_pair(X1,X2)) = empty_set,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SET881+1 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n017.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 16:33:26 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.hdICZPI6gQ/E---3.1_8381.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8460 completed with status 0
% 0.16/0.44 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.44 # Starting sh5l with 136s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 8464 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 8
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 14
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 14
% 0.16/0.44 # Processed clauses : 35
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 4
% 0.16/0.44 # ...remaining for further processing : 31
% 0.16/0.44 # Other redundant clauses eliminated : 5
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 1
% 0.16/0.44 # Generated clauses : 21
% 0.16/0.44 # ...of the previous two non-redundant : 15
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 18
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 5
% 0.16/0.44 # Total rewrite steps : 4
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 13
% 0.16/0.44 # Positive orientable unit clauses : 6
% 0.16/0.44 # Positive unorientable unit clauses: 1
% 0.16/0.44 # Negative unit clauses : 3
% 0.16/0.44 # Non-unit-clauses : 3
% 0.16/0.44 # Current number of unprocessed clauses: 8
% 0.16/0.44 # ...number of literals in the above : 17
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 15
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 2
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 2
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 1
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 9
% 0.16/0.44 # BW rewrite match successes : 5
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 784
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.003 s
% 0.16/0.44 # System time : 0.001 s
% 0.16/0.44 # Total time : 0.004 s
% 0.16/0.44 # Maximum resident set size: 1728 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.014 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.016 s
% 0.16/0.44 # Maximum resident set size: 1676 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------