TSTP Solution File: SET881+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n021.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:17 EDT 2023
% Result : Theorem 0.23s 0.54s
% Output : CNFRefutation 0.23s
% 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/sandbox2/tmp/tmp.rzsiS1k5Hz/E---3.1_23078.p',d2_tarski) ).
fof(t22_zfmisc_1,conjecture,
! [X1,X2] : set_difference(singleton(X1),unordered_pair(X1,X2)) = empty_set,
file('/export/starexec/sandbox2/tmp/tmp.rzsiS1k5Hz/E---3.1_23078.p',t22_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.rzsiS1k5Hz/E---3.1_23078.p',l36_zfmisc_1) ).
fof(c_0_3,plain,
! [X11,X12,X13,X14,X15,X16,X17,X18] :
( ( ~ in(X14,X13)
| X14 = X11
| X14 = X12
| X13 != unordered_pair(X11,X12) )
& ( X15 != X11
| in(X15,X13)
| X13 != unordered_pair(X11,X12) )
& ( X15 != X12
| in(X15,X13)
| X13 != unordered_pair(X11,X12) )
& ( esk3_3(X16,X17,X18) != X16
| ~ in(esk3_3(X16,X17,X18),X18)
| X18 = unordered_pair(X16,X17) )
& ( esk3_3(X16,X17,X18) != X17
| ~ in(esk3_3(X16,X17,X18),X18)
| X18 = unordered_pair(X16,X17) )
& ( in(esk3_3(X16,X17,X18),X18)
| esk3_3(X16,X17,X18) = X16
| esk3_3(X16,X17,X18) = X17
| X18 = unordered_pair(X16,X17) ) ),
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,
! [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])]) ).
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(esk1_0),unordered_pair(esk1_0,esk2_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(esk1_0),unordered_pair(esk1_0,esk2_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.14/0.14 % Problem : SET881+1 : TPTP v8.1.2. Released v3.2.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n021.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 17:06:14 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order model finding
% 0.23/0.52 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/tmp/tmp.rzsiS1k5Hz/E---3.1_23078.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # new_bool_1 with pid 23157 completed with status 0
% 0.23/0.54 # Result found by new_bool_1
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.23/0.54 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 23166 completed with status 0
% 0.23/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54 # Presaturation interreduction done
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Theorem
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 8
% 0.23/0.54 # Removed by relevancy pruning/SinE : 0
% 0.23/0.54 # Initial clauses : 14
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 14
% 0.23/0.54 # Processed clauses : 35
% 0.23/0.54 # ...of these trivial : 0
% 0.23/0.54 # ...subsumed : 4
% 0.23/0.54 # ...remaining for further processing : 31
% 0.23/0.54 # Other redundant clauses eliminated : 5
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 0
% 0.23/0.54 # Backward-rewritten : 1
% 0.23/0.54 # Generated clauses : 21
% 0.23/0.54 # ...of the previous two non-redundant : 15
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 0
% 0.23/0.54 # Paramodulations : 18
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 5
% 0.23/0.54 # Total rewrite steps : 4
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 13
% 0.23/0.54 # Positive orientable unit clauses : 6
% 0.23/0.54 # Positive unorientable unit clauses: 1
% 0.23/0.54 # Negative unit clauses : 3
% 0.23/0.54 # Non-unit-clauses : 3
% 0.23/0.54 # Current number of unprocessed clauses: 8
% 0.23/0.54 # ...number of literals in the above : 17
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 15
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 2
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 2
% 0.23/0.54 # Non-unit clause-clause subsumptions : 0
% 0.23/0.54 # Unit Clause-clause subsumption calls : 1
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 9
% 0.23/0.54 # BW rewrite match successes : 5
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 784
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.004 s
% 0.23/0.54 # System time : 0.003 s
% 0.23/0.54 # Total time : 0.006 s
% 0.23/0.54 # Maximum resident set size: 1732 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.006 s
% 0.23/0.54 # System time : 0.004 s
% 0.23/0.54 # Total time : 0.010 s
% 0.23/0.54 # Maximum resident set size: 1676 pages
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------