TSTP Solution File: SEU164+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU164+3 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:25:03 EDT 2023
% Result : Theorem 1.10s 0.62s
% Output : CNFRefutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 98 ( 29 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 105 ( 37 ~; 51 |; 11 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 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 : 66 ( 1 sgn; 33 !; 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/sandbox/tmp/tmp.61RGcDUcAA/E---3.1_32345.p',d4_tarski) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.61RGcDUcAA/E---3.1_32345.p',d1_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.61RGcDUcAA/E---3.1_32345.p',reflexivity_r1_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.61RGcDUcAA/E---3.1_32345.p',d3_tarski) ).
fof(t99_zfmisc_1,conjecture,
! [X1] : union(powerset(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.61RGcDUcAA/E---3.1_32345.p',t99_zfmisc_1) ).
fof(c_0_5,plain,
! [X6,X7,X8,X10,X11,X12,X13,X15] :
( ( in(X8,esk2_3(X6,X7,X8))
| ~ in(X8,X7)
| X7 != union(X6) )
& ( in(esk2_3(X6,X7,X8),X6)
| ~ in(X8,X7)
| X7 != union(X6) )
& ( ~ in(X10,X11)
| ~ in(X11,X6)
| in(X10,X7)
| X7 != union(X6) )
& ( ~ in(esk3_2(X12,X13),X13)
| ~ in(esk3_2(X12,X13),X15)
| ~ in(X15,X12)
| X13 = union(X12) )
& ( in(esk3_2(X12,X13),esk4_2(X12,X13))
| in(esk3_2(X12,X13),X13)
| X13 = union(X12) )
& ( in(esk4_2(X12,X13),X12)
| in(esk3_2(X12,X13),X13)
| X13 = union(X12) ) ),
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])])])])])]) ).
fof(c_0_6,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( ~ in(X19,X18)
| subset(X19,X17)
| X18 != powerset(X17) )
& ( ~ subset(X20,X17)
| in(X20,X18)
| X18 != powerset(X17) )
& ( ~ in(esk5_2(X21,X22),X22)
| ~ subset(esk5_2(X21,X22),X21)
| X22 = powerset(X21) )
& ( in(esk5_2(X21,X22),X22)
| subset(esk5_2(X21,X22),X21)
| X22 = powerset(X21) ) ),
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_zfmisc_1])])])])])]) ).
cnf(c_0_7,plain,
( X2 = union(X1)
| ~ in(esk3_2(X1,X2),X2)
| ~ in(esk3_2(X1,X2),X3)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(esk4_2(X1,X2),X1)
| in(esk3_2(X1,X2),X2)
| X2 = union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| X3 != powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X1 = union(X2)
| in(esk4_2(X2,X1),X2)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_11,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X44] : subset(X44,X44),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_13,plain,
( subset(X1,X3)
| ~ in(X1,X2)
| X2 != powerset(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( X1 = union(powerset(X2))
| in(esk4_2(powerset(X2),X1),powerset(X2))
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X33,X34,X35,X36,X37] :
( ( ~ subset(X33,X34)
| ~ in(X35,X33)
| in(X35,X34) )
& ( in(esk7_2(X36,X37),X36)
| subset(X36,X37) )
& ( ~ in(esk7_2(X36,X37),X37)
| subset(X36,X37) ) ),
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)],[d3_tarski])])])])])]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( union(powerset(X1)) = X1
| in(esk4_2(powerset(X1),X1),powerset(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( union(powerset(X1)) = X1
| subset(esk4_2(powerset(X1),X1),X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( union(powerset(X1)) = X1
| in(X2,X1)
| ~ in(X2,esk4_2(powerset(X1),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( in(esk3_2(X1,X2),esk4_2(X1,X2))
| in(esk3_2(X1,X2),X2)
| X2 = union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_23,negated_conjecture,
~ ! [X1] : union(powerset(X1)) = X1,
inference(assume_negation,[status(cth)],[t99_zfmisc_1]) ).
cnf(c_0_24,plain,
( union(powerset(X1)) = X1
| in(esk3_2(powerset(X1),X1),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_25,negated_conjecture,
union(powerset(esk1_0)) != esk1_0,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_26,plain,
( union(powerset(X1)) = X1
| ~ in(X1,powerset(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_24]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
union(powerset(esk1_0)) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
union(powerset(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_11]),c_0_15])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU164+3 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n008.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 08:22:58 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.61RGcDUcAA/E---3.1_32345.p
% 1.10/0.62 # Version: 3.1pre001
% 1.10/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.10/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.10/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.10/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.10/0.62 # Starting sh5l with 300s (1) cores
% 1.10/0.62 # sh5l with pid 32426 completed with status 0
% 1.10/0.62 # Result found by sh5l
% 1.10/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.10/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.10/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.10/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.10/0.62 # Starting sh5l with 300s (1) cores
% 1.10/0.62 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.10/0.62 # Search class: FGHSF-FFMF31-SFFFFFNN
% 1.10/0.62 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.10/0.62 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 152s (1) cores
% 1.10/0.62 # G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with pid 32432 completed with status 0
% 1.10/0.62 # Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 1.10/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.10/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.10/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.10/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.10/0.62 # Starting sh5l with 300s (1) cores
% 1.10/0.62 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.10/0.62 # Search class: FGHSF-FFMF31-SFFFFFNN
% 1.10/0.62 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.10/0.62 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 152s (1) cores
% 1.10/0.62 # Preprocessing time : 0.001 s
% 1.10/0.62 # Presaturation interreduction done
% 1.10/0.62
% 1.10/0.62 # Proof found!
% 1.10/0.62 # SZS status Theorem
% 1.10/0.62 # SZS output start CNFRefutation
% See solution above
% 1.10/0.62 # Parsed axioms : 11
% 1.10/0.62 # Removed by relevancy pruning/SinE : 2
% 1.10/0.62 # Initial clauses : 24
% 1.10/0.62 # Removed in clause preprocessing : 0
% 1.10/0.62 # Initial clauses in saturation : 24
% 1.10/0.62 # Processed clauses : 1132
% 1.10/0.62 # ...of these trivial : 11
% 1.10/0.62 # ...subsumed : 427
% 1.10/0.62 # ...remaining for further processing : 694
% 1.10/0.62 # Other redundant clauses eliminated : 16
% 1.10/0.62 # Clauses deleted for lack of memory : 0
% 1.10/0.62 # Backward-subsumed : 10
% 1.10/0.62 # Backward-rewritten : 226
% 1.10/0.62 # Generated clauses : 12604
% 1.10/0.62 # ...of the previous two non-redundant : 12405
% 1.10/0.62 # ...aggressively subsumed : 0
% 1.10/0.62 # Contextual simplify-reflections : 2
% 1.10/0.62 # Paramodulations : 12499
% 1.10/0.62 # Factorizations : 6
% 1.10/0.62 # NegExts : 0
% 1.10/0.62 # Equation resolutions : 99
% 1.10/0.62 # Total rewrite steps : 1902
% 1.10/0.62 # Propositional unsat checks : 0
% 1.10/0.62 # Propositional check models : 0
% 1.10/0.62 # Propositional check unsatisfiable : 0
% 1.10/0.62 # Propositional clauses : 0
% 1.10/0.62 # Propositional clauses after purity: 0
% 1.10/0.62 # Propositional unsat core size : 0
% 1.10/0.62 # Propositional preprocessing time : 0.000
% 1.10/0.62 # Propositional encoding time : 0.000
% 1.10/0.62 # Propositional solver time : 0.000
% 1.10/0.62 # Success case prop preproc time : 0.000
% 1.10/0.62 # Success case prop encoding time : 0.000
% 1.10/0.62 # Success case prop solver time : 0.000
% 1.10/0.62 # Current number of processed clauses : 433
% 1.10/0.62 # Positive orientable unit clauses : 10
% 1.10/0.62 # Positive unorientable unit clauses: 0
% 1.10/0.62 # Negative unit clauses : 126
% 1.10/0.62 # Non-unit-clauses : 297
% 1.10/0.62 # Current number of unprocessed clauses: 11179
% 1.10/0.62 # ...number of literals in the above : 24191
% 1.10/0.62 # Current number of archived formulas : 0
% 1.10/0.62 # Current number of archived clauses : 260
% 1.10/0.62 # Clause-clause subsumption calls (NU) : 39475
% 1.10/0.62 # Rec. Clause-clause subsumption calls : 30619
% 1.10/0.62 # Non-unit clause-clause subsumptions : 142
% 1.10/0.62 # Unit Clause-clause subsumption calls : 8641
% 1.10/0.62 # Rewrite failures with RHS unbound : 0
% 1.10/0.62 # BW rewrite match attempts : 98
% 1.10/0.62 # BW rewrite match successes : 59
% 1.10/0.62 # Condensation attempts : 0
% 1.10/0.62 # Condensation successes : 0
% 1.10/0.62 # Termbank termtop insertions : 213233
% 1.10/0.62
% 1.10/0.62 # -------------------------------------------------
% 1.10/0.62 # User time : 0.190 s
% 1.10/0.62 # System time : 0.006 s
% 1.10/0.62 # Total time : 0.196 s
% 1.10/0.62 # Maximum resident set size: 1712 pages
% 1.10/0.62
% 1.10/0.62 # -------------------------------------------------
% 1.10/0.62 # User time : 0.191 s
% 1.10/0.62 # System time : 0.007 s
% 1.10/0.62 # Total time : 0.198 s
% 1.10/0.62 # Maximum resident set size: 1688 pages
% 1.10/0.62 % E---3.1 exiting
% 1.10/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------