TSTP Solution File: SEU114+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU114+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:30:24 EDT 2023
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 10 unt; 0 def)
% Number of atoms : 122 ( 17 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 133 ( 51 ~; 57 |; 13 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 68 ( 1 sgn; 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_finsub_1,axiom,
! [X1,X2] :
( preboolean(X2)
=> ( X2 = finite_subsets(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( subset(X3,X1)
& finite(X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6vu3dt87vq/E---3.1_24337.p',d5_finsub_1) ).
fof(dt_k5_finsub_1,axiom,
! [X1] : preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox2/tmp/tmp.6vu3dt87vq/E---3.1_24337.p',dt_k5_finsub_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.6vu3dt87vq/E---3.1_24337.p',t3_subset) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.6vu3dt87vq/E---3.1_24337.p',t1_subset) ).
fof(cc2_finset_1,axiom,
! [X1] :
( finite(X1)
=> ! [X2] :
( element(X2,powerset(X1))
=> finite(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6vu3dt87vq/E---3.1_24337.p',cc2_finset_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6vu3dt87vq/E---3.1_24337.p',d3_tarski) ).
fof(t27_finsub_1,conjecture,
! [X1] :
( finite(X1)
=> finite_subsets(X1) = powerset(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6vu3dt87vq/E---3.1_24337.p',t27_finsub_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6vu3dt87vq/E---3.1_24337.p',d10_xboole_0) ).
fof(t26_finsub_1,axiom,
! [X1] : subset(finite_subsets(X1),powerset(X1)),
file('/export/starexec/sandbox2/tmp/tmp.6vu3dt87vq/E---3.1_24337.p',t26_finsub_1) ).
fof(c_0_9,plain,
! [X21,X22,X23,X24] :
( ( subset(X23,X21)
| ~ in(X23,X22)
| X22 != finite_subsets(X21)
| ~ preboolean(X22) )
& ( finite(X23)
| ~ in(X23,X22)
| X22 != finite_subsets(X21)
| ~ preboolean(X22) )
& ( ~ subset(X24,X21)
| ~ finite(X24)
| in(X24,X22)
| X22 != finite_subsets(X21)
| ~ preboolean(X22) )
& ( ~ in(esk2_2(X21,X22),X22)
| ~ subset(esk2_2(X21,X22),X21)
| ~ finite(esk2_2(X21,X22))
| X22 = finite_subsets(X21)
| ~ preboolean(X22) )
& ( subset(esk2_2(X21,X22),X21)
| in(esk2_2(X21,X22),X22)
| X22 = finite_subsets(X21)
| ~ preboolean(X22) )
& ( finite(esk2_2(X21,X22))
| in(esk2_2(X21,X22),X22)
| X22 = finite_subsets(X21)
| ~ preboolean(X22) ) ),
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)],[d5_finsub_1])])])])])]) ).
fof(c_0_10,plain,
! [X26] : preboolean(finite_subsets(X26)),
inference(variable_rename,[status(thm)],[dt_k5_finsub_1]) ).
fof(c_0_11,plain,
! [X55,X56] :
( ( ~ element(X55,powerset(X56))
| subset(X55,X56) )
& ( ~ subset(X55,X56)
| element(X55,powerset(X56)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_12,plain,
! [X49,X50] :
( ~ in(X49,X50)
| element(X49,X50) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_13,plain,
! [X8,X9] :
( ~ finite(X8)
| ~ element(X9,powerset(X8))
| finite(X9) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_finset_1])])]) ).
fof(c_0_14,plain,
! [X15,X16,X17,X18,X19] :
( ( ~ subset(X15,X16)
| ~ in(X17,X15)
| in(X17,X16) )
& ( in(esk1_2(X18,X19),X18)
| subset(X18,X19) )
& ( ~ in(esk1_2(X18,X19),X19)
| subset(X18,X19) ) ),
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_15,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| ~ finite(X1)
| X3 != finite_subsets(X2)
| ~ preboolean(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
preboolean(finite_subsets(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( finite(X2)
| ~ finite(X1)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
( finite(X1)
=> finite_subsets(X1) = powerset(X1) ),
inference(assume_negation,[status(cth)],[t27_finsub_1]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( in(X1,finite_subsets(X2))
| ~ subset(X1,X2)
| ~ finite(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_15]),c_0_16])]) ).
cnf(c_0_23,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( finite(X1)
| ~ finite(X2)
| ~ in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
fof(c_0_26,negated_conjecture,
( finite(esk13_0)
& finite_subsets(esk13_0) != powerset(esk13_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_27,plain,
( subset(X1,finite_subsets(X2))
| ~ subset(esk1_2(X1,finite_subsets(X2)),X2)
| ~ finite(esk1_2(X1,finite_subsets(X2))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( subset(esk1_2(powerset(X1),X2),X1)
| subset(powerset(X1),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( subset(powerset(X1),X2)
| finite(esk1_2(powerset(X1),X2))
| ~ finite(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
finite(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_31,plain,
! [X13,X14] :
( ( subset(X13,X14)
| X13 != X14 )
& ( subset(X14,X13)
| X13 != X14 )
& ( ~ subset(X13,X14)
| ~ subset(X14,X13)
| X13 = X14 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
cnf(c_0_32,plain,
( subset(powerset(X1),finite_subsets(X1))
| ~ finite(esk1_2(powerset(X1),finite_subsets(X1))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( subset(powerset(esk13_0),X1)
| finite(esk1_2(powerset(esk13_0),X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_34,plain,
! [X51] : subset(finite_subsets(X51),powerset(X51)),
inference(variable_rename,[status(thm)],[t26_finsub_1]) ).
cnf(c_0_35,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
subset(powerset(esk13_0),finite_subsets(esk13_0)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
subset(finite_subsets(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
finite_subsets(esk13_0) != powerset(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU114+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n020.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 09:17:31 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.6vu3dt87vq/E---3.1_24337.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24414 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.53 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24419 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.53 # Preprocessing time : 0.002 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 36
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 74
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 74
% 0.20/0.53 # Processed clauses : 577
% 0.20/0.53 # ...of these trivial : 5
% 0.20/0.53 # ...subsumed : 247
% 0.20/0.53 # ...remaining for further processing : 325
% 0.20/0.53 # Other redundant clauses eliminated : 5
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 9
% 0.20/0.53 # Backward-rewritten : 5
% 0.20/0.53 # Generated clauses : 1021
% 0.20/0.53 # ...of the previous two non-redundant : 824
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 10
% 0.20/0.53 # Paramodulations : 1016
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 5
% 0.20/0.53 # Total rewrite steps : 240
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 236
% 0.20/0.53 # Positive orientable unit clauses : 44
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 9
% 0.20/0.53 # Non-unit-clauses : 183
% 0.20/0.53 # Current number of unprocessed clauses: 366
% 0.20/0.53 # ...number of literals in the above : 1057
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 84
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 2670
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 2220
% 0.20/0.53 # Non-unit clause-clause subsumptions : 183
% 0.20/0.53 # Unit Clause-clause subsumption calls : 185
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 5
% 0.20/0.53 # BW rewrite match successes : 5
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 15251
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.029 s
% 0.20/0.53 # System time : 0.007 s
% 0.20/0.53 # Total time : 0.036 s
% 0.20/0.53 # Maximum resident set size: 1880 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.143 s
% 0.20/0.53 # System time : 0.023 s
% 0.20/0.53 # Total time : 0.166 s
% 0.20/0.53 # Maximum resident set size: 1708 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------