TSTP Solution File: SET921+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET921+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:23 EDT 2023
% Result : Theorem 0.17s 0.43s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 97 ( 34 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 115 ( 45 ~; 48 |; 14 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 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 : 64 ( 5 sgn; 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CUVY6YQEsi/E---3.1_23509.p',d4_xboole_0) ).
fof(t64_zfmisc_1,conjecture,
! [X1,X2,X3] :
( in(X1,set_difference(X2,singleton(X3)))
<=> ( in(X1,X2)
& X1 != X3 ) ),
file('/export/starexec/sandbox2/tmp/tmp.CUVY6YQEsi/E---3.1_23509.p',t64_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.CUVY6YQEsi/E---3.1_23509.p',d1_tarski) ).
fof(c_0_3,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_4,plain,
! [X10,X11,X12,X13,X14,X15,X16,X17] :
( ( in(X13,X10)
| ~ in(X13,X12)
| X12 != set_difference(X10,X11) )
& ( ~ in(X13,X11)
| ~ in(X13,X12)
| X12 != set_difference(X10,X11) )
& ( ~ in(X14,X10)
| in(X14,X11)
| in(X14,X12)
| X12 != set_difference(X10,X11) )
& ( ~ in(esk4_3(X15,X16,X17),X17)
| ~ in(esk4_3(X15,X16,X17),X15)
| in(esk4_3(X15,X16,X17),X16)
| X17 = set_difference(X15,X16) )
& ( in(esk4_3(X15,X16,X17),X15)
| in(esk4_3(X15,X16,X17),X17)
| X17 = set_difference(X15,X16) )
& ( ~ in(esk4_3(X15,X16,X17),X16)
| in(esk4_3(X15,X16,X17),X17)
| X17 = set_difference(X15,X16) ) ),
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)],[c_0_3])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( in(X1,set_difference(X2,singleton(X3)))
<=> ( in(X1,X2)
& X1 != X3 ) ),
inference(assume_negation,[status(cth)],[t64_zfmisc_1]) ).
cnf(c_0_6,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
( ( ~ in(esk1_0,set_difference(esk2_0,singleton(esk3_0)))
| ~ in(esk1_0,esk2_0)
| esk1_0 = esk3_0 )
& ( in(esk1_0,esk2_0)
| in(esk1_0,set_difference(esk2_0,singleton(esk3_0))) )
& ( esk1_0 != esk3_0
| in(esk1_0,set_difference(esk2_0,singleton(esk3_0))) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_8,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( in(esk1_0,esk2_0)
| in(esk1_0,set_difference(esk2_0,singleton(esk3_0))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X19,X20,X21,X22,X23,X24] :
( ( ~ in(X21,X20)
| X21 = X19
| X20 != singleton(X19) )
& ( X22 != X19
| in(X22,X20)
| X20 != singleton(X19) )
& ( ~ in(esk5_2(X23,X24),X24)
| esk5_2(X23,X24) != X23
| X24 = singleton(X23) )
& ( in(esk5_2(X23,X24),X24)
| esk5_2(X23,X24) = X23
| X24 = singleton(X23) ) ),
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)],[d1_tarski])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( esk1_0 = esk3_0
| ~ in(esk1_0,set_difference(esk2_0,singleton(esk3_0)))
| ~ in(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
in(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( esk3_0 = esk1_0
| ~ in(esk1_0,set_difference(esk2_0,singleton(esk3_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
( in(esk1_0,set_difference(esk2_0,X1))
| in(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_20,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])]) ).
cnf(c_0_23,negated_conjecture,
( in(esk1_0,set_difference(esk2_0,singleton(esk3_0)))
| esk1_0 != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
esk3_0 = esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
~ in(X1,set_difference(X2,singleton(X1))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SET921+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n013.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 17:21:29 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.17/0.42 Running first-order model finding
% 0.17/0.42 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.CUVY6YQEsi/E---3.1_23509.p
% 0.17/0.43 # Version: 3.1pre001
% 0.17/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43 # Starting sh5l with 300s (1) cores
% 0.17/0.43 # new_bool_3 with pid 23587 completed with status 0
% 0.17/0.43 # Result found by new_bool_3
% 0.17/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.43 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.17/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.17/0.43 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 23590 completed with status 0
% 0.17/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.17/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.43 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.17/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.17/0.43 # Preprocessing time : 0.001 s
% 0.17/0.43 # Presaturation interreduction done
% 0.17/0.43
% 0.17/0.43 # Proof found!
% 0.17/0.43 # SZS status Theorem
% 0.17/0.43 # SZS output start CNFRefutation
% See solution above
% 0.17/0.43 # Parsed axioms : 6
% 0.17/0.43 # Removed by relevancy pruning/SinE : 2
% 0.17/0.43 # Initial clauses : 14
% 0.17/0.43 # Removed in clause preprocessing : 0
% 0.17/0.43 # Initial clauses in saturation : 14
% 0.17/0.43 # Processed clauses : 46
% 0.17/0.43 # ...of these trivial : 0
% 0.17/0.43 # ...subsumed : 1
% 0.17/0.43 # ...remaining for further processing : 45
% 0.17/0.43 # Other redundant clauses eliminated : 6
% 0.17/0.43 # Clauses deleted for lack of memory : 0
% 0.17/0.43 # Backward-subsumed : 0
% 0.17/0.43 # Backward-rewritten : 6
% 0.17/0.43 # Generated clauses : 40
% 0.17/0.43 # ...of the previous two non-redundant : 38
% 0.17/0.43 # ...aggressively subsumed : 0
% 0.17/0.43 # Contextual simplify-reflections : 1
% 0.17/0.43 # Paramodulations : 33
% 0.17/0.43 # Factorizations : 2
% 0.17/0.43 # NegExts : 0
% 0.17/0.43 # Equation resolutions : 6
% 0.17/0.43 # Total rewrite steps : 11
% 0.17/0.43 # Propositional unsat checks : 0
% 0.17/0.43 # Propositional check models : 0
% 0.17/0.43 # Propositional check unsatisfiable : 0
% 0.17/0.43 # Propositional clauses : 0
% 0.17/0.43 # Propositional clauses after purity: 0
% 0.17/0.43 # Propositional unsat core size : 0
% 0.17/0.43 # Propositional preprocessing time : 0.000
% 0.17/0.43 # Propositional encoding time : 0.000
% 0.17/0.43 # Propositional solver time : 0.000
% 0.17/0.43 # Success case prop preproc time : 0.000
% 0.17/0.43 # Success case prop encoding time : 0.000
% 0.17/0.43 # Success case prop solver time : 0.000
% 0.17/0.43 # Current number of processed clauses : 20
% 0.17/0.43 # Positive orientable unit clauses : 3
% 0.17/0.43 # Positive unorientable unit clauses: 0
% 0.17/0.43 # Negative unit clauses : 4
% 0.17/0.43 # Non-unit-clauses : 13
% 0.17/0.43 # Current number of unprocessed clauses: 20
% 0.17/0.43 # ...number of literals in the above : 61
% 0.17/0.43 # Current number of archived formulas : 0
% 0.17/0.43 # Current number of archived clauses : 20
% 0.17/0.43 # Clause-clause subsumption calls (NU) : 134
% 0.17/0.43 # Rec. Clause-clause subsumption calls : 111
% 0.17/0.43 # Non-unit clause-clause subsumptions : 2
% 0.17/0.43 # Unit Clause-clause subsumption calls : 18
% 0.17/0.43 # Rewrite failures with RHS unbound : 0
% 0.17/0.43 # BW rewrite match attempts : 4
% 0.17/0.43 # BW rewrite match successes : 2
% 0.17/0.43 # Condensation attempts : 0
% 0.17/0.43 # Condensation successes : 0
% 0.17/0.43 # Termbank termtop insertions : 1421
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.006 s
% 0.17/0.43 # System time : 0.001 s
% 0.17/0.43 # Total time : 0.006 s
% 0.17/0.43 # Maximum resident set size: 1768 pages
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.006 s
% 0.17/0.43 # System time : 0.003 s
% 0.17/0.43 # Total time : 0.009 s
% 0.17/0.43 # Maximum resident set size: 1676 pages
% 0.17/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------