TSTP Solution File: SET890+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET890+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:24:38 EDT 2024
% Result : Theorem 0.36s 0.54s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 112 ( 37 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 127 ( 50 ~; 56 |; 14 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-3 aty)
% Number of variables : 81 ( 0 sgn 34 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6urKDWsbIC/E---3.1_23443.p',d4_tarski) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.6urKDWsbIC/E---3.1_23443.p',d1_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6urKDWsbIC/E---3.1_23443.p',d3_tarski) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6urKDWsbIC/E---3.1_23443.p',d10_xboole_0) ).
fof(t31_zfmisc_1,conjecture,
! [X1] : union(singleton(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.6urKDWsbIC/E---3.1_23443.p',t31_zfmisc_1) ).
fof(c_0_5,plain,
! [X22,X23,X24,X26,X27,X28,X29,X31] :
( ( in(X24,esk3_3(X22,X23,X24))
| ~ in(X24,X23)
| X23 != union(X22) )
& ( in(esk3_3(X22,X23,X24),X22)
| ~ in(X24,X23)
| X23 != union(X22) )
& ( ~ in(X26,X27)
| ~ in(X27,X22)
| in(X26,X23)
| X23 != union(X22) )
& ( ~ in(esk4_2(X28,X29),X29)
| ~ in(esk4_2(X28,X29),X31)
| ~ in(X31,X28)
| X29 = union(X28) )
& ( in(esk4_2(X28,X29),esk5_2(X28,X29))
| in(esk4_2(X28,X29),X29)
| X29 = union(X28) )
& ( in(esk5_2(X28,X29),X28)
| in(esk4_2(X28,X29),X29)
| X29 = union(X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( ~ in(X11,X10)
| X11 = X9
| X10 != singleton(X9) )
& ( X12 != X9
| in(X12,X10)
| X10 != singleton(X9) )
& ( ~ in(esk1_2(X13,X14),X14)
| esk1_2(X13,X14) != X13
| X14 = singleton(X13) )
& ( in(esk1_2(X13,X14),X14)
| esk1_2(X13,X14) = X13
| X14 = singleton(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_7,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X2,X3)
| X4 != union(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(esk3_3(X1,X2,X3),X1)
| ~ in(X3,X2)
| X2 != union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X16,X17,X18,X19,X20] :
( ( ~ subset(X16,X17)
| ~ in(X18,X16)
| in(X18,X17) )
& ( in(esk2_2(X19,X20),X19)
| subset(X19,X20) )
& ( ~ in(esk2_2(X19,X20),X20)
| subset(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[d3_tarski])])])])])])]) ).
cnf(c_0_12,plain,
( in(X1,union(X2))
| ~ in(X3,X2)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_8])]) ).
cnf(c_0_14,plain,
( in(X1,esk3_3(X2,X3,X1))
| ~ in(X1,X3)
| X3 != union(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( in(esk3_3(X1,union(X1),X2),X1)
| ~ in(X2,union(X1)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( in(X1,union(singleton(X2)))
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( in(X1,esk3_3(X2,union(X2),X1))
| ~ in(X1,union(X2)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( esk3_3(singleton(X1),union(singleton(X1)),X2) = X1
| ~ in(X2,union(singleton(X1))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X7,X8] :
( ( subset(X7,X8)
| X7 != X8 )
& ( subset(X8,X7)
| X7 != X8 )
& ( ~ subset(X7,X8)
| ~ subset(X8,X7)
| X7 = X8 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_22,plain,
( subset(X1,union(singleton(X2)))
| ~ in(esk2_2(X1,union(singleton(X2))),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( in(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
( in(X1,X2)
| ~ in(X1,union(singleton(X2))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_25,negated_conjecture,
~ ! [X1] : union(singleton(X1)) = X1,
inference(assume_negation,[status(cth)],[t31_zfmisc_1]) ).
cnf(c_0_26,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
subset(X1,union(singleton(X1))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( subset(union(singleton(X1)),X2)
| in(esk2_2(union(singleton(X1)),X2),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
fof(c_0_29,negated_conjecture,
union(singleton(esk8_0)) != esk8_0,
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
cnf(c_0_30,plain,
( union(singleton(X1)) = X1
| ~ subset(union(singleton(X1)),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
subset(union(singleton(X1)),X1),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
union(singleton(esk8_0)) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
union(singleton(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET890+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 10:23:41 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.51 Running first-order model finding
% 0.20/0.51 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.6urKDWsbIC/E---3.1_23443.p
% 0.36/0.54 # Version: 3.1.0
% 0.36/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.54 # Starting sh5l with 300s (1) cores
% 0.36/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23564 completed with status 0
% 0.36/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.36/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.54 # No SInE strategy applied
% 0.36/0.54 # Search class: FGHSF-FFMF31-SFFFFFNN
% 0.36/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.54 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 756s (1) cores
% 0.36/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.36/0.54 # Starting new_bool_3 with 162s (1) cores
% 0.36/0.54 # Starting new_bool_1 with 158s (1) cores
% 0.36/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.36/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23573 completed with status 0
% 0.36/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.36/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.54 # No SInE strategy applied
% 0.36/0.54 # Search class: FGHSF-FFMF31-SFFFFFNN
% 0.36/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.54 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 756s (1) cores
% 0.36/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.36/0.54 # Preprocessing time : 0.001 s
% 0.36/0.54 # Presaturation interreduction done
% 0.36/0.54
% 0.36/0.54 # Proof found!
% 0.36/0.54 # SZS status Theorem
% 0.36/0.54 # SZS output start CNFRefutation
% See solution above
% 0.36/0.55 # Parsed axioms : 10
% 0.36/0.55 # Removed by relevancy pruning/SinE : 0
% 0.36/0.55 # Initial clauses : 22
% 0.36/0.55 # Removed in clause preprocessing : 0
% 0.36/0.55 # Initial clauses in saturation : 22
% 0.36/0.55 # Processed clauses : 186
% 0.36/0.55 # ...of these trivial : 0
% 0.36/0.55 # ...subsumed : 25
% 0.36/0.55 # ...remaining for further processing : 161
% 0.36/0.55 # Other redundant clauses eliminated : 11
% 0.36/0.55 # Clauses deleted for lack of memory : 0
% 0.36/0.55 # Backward-subsumed : 0
% 0.36/0.55 # Backward-rewritten : 44
% 0.36/0.55 # Generated clauses : 624
% 0.36/0.55 # ...of the previous two non-redundant : 467
% 0.36/0.55 # ...aggressively subsumed : 0
% 0.36/0.55 # Contextual simplify-reflections : 0
% 0.36/0.55 # Paramodulations : 612
% 0.36/0.55 # Factorizations : 2
% 0.36/0.55 # NegExts : 0
% 0.36/0.55 # Equation resolutions : 11
% 0.36/0.55 # Disequality decompositions : 0
% 0.36/0.55 # Total rewrite steps : 171
% 0.36/0.55 # ...of those cached : 138
% 0.36/0.55 # Propositional unsat checks : 0
% 0.36/0.55 # Propositional check models : 0
% 0.36/0.55 # Propositional check unsatisfiable : 0
% 0.36/0.55 # Propositional clauses : 0
% 0.36/0.55 # Propositional clauses after purity: 0
% 0.36/0.55 # Propositional unsat core size : 0
% 0.36/0.55 # Propositional preprocessing time : 0.000
% 0.36/0.55 # Propositional encoding time : 0.000
% 0.36/0.55 # Propositional solver time : 0.000
% 0.36/0.55 # Success case prop preproc time : 0.000
% 0.36/0.55 # Success case prop encoding time : 0.000
% 0.36/0.55 # Success case prop solver time : 0.000
% 0.36/0.55 # Current number of processed clauses : 90
% 0.36/0.55 # Positive orientable unit clauses : 4
% 0.36/0.55 # Positive unorientable unit clauses: 0
% 0.36/0.55 # Negative unit clauses : 44
% 0.36/0.55 # Non-unit-clauses : 42
% 0.36/0.55 # Current number of unprocessed clauses: 287
% 0.36/0.55 # ...number of literals in the above : 682
% 0.36/0.55 # Current number of archived formulas : 0
% 0.36/0.55 # Current number of archived clauses : 64
% 0.36/0.55 # Clause-clause subsumption calls (NU) : 598
% 0.36/0.55 # Rec. Clause-clause subsumption calls : 562
% 0.36/0.55 # Non-unit clause-clause subsumptions : 13
% 0.36/0.55 # Unit Clause-clause subsumption calls : 932
% 0.36/0.55 # Rewrite failures with RHS unbound : 0
% 0.36/0.55 # BW rewrite match attempts : 31
% 0.36/0.55 # BW rewrite match successes : 27
% 0.36/0.55 # Condensation attempts : 0
% 0.36/0.55 # Condensation successes : 0
% 0.36/0.55 # Termbank termtop insertions : 12744
% 0.36/0.55 # Search garbage collected termcells : 441
% 0.36/0.55
% 0.36/0.55 # -------------------------------------------------
% 0.36/0.55 # User time : 0.022 s
% 0.36/0.55 # System time : 0.003 s
% 0.36/0.55 # Total time : 0.025 s
% 0.36/0.55 # Maximum resident set size: 1756 pages
% 0.36/0.55
% 0.36/0.55 # -------------------------------------------------
% 0.36/0.55 # User time : 0.078 s
% 0.36/0.55 # System time : 0.011 s
% 0.36/0.55 # Total time : 0.089 s
% 0.36/0.55 # Maximum resident set size: 1696 pages
% 0.36/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------