TSTP Solution File: SEU110+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU110+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:25:06 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 106 ( 10 equ)
% Maximal formula atoms : 26 ( 2 avg)
% Number of connectives : 121 ( 51 ~; 52 |; 10 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 6 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_finsub_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> subset(finite_subsets(X1),finite_subsets(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.tbJCWAvnUA/E---3.1_16737.p',t23_finsub_1) ).
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.tbJCWAvnUA/E---3.1_16737.p',t1_xboole_1) ).
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/sandbox/tmp/tmp.tbJCWAvnUA/E---3.1_16737.p',d5_finsub_1) ).
fof(dt_k5_finsub_1,axiom,
! [X1] : preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox/tmp/tmp.tbJCWAvnUA/E---3.1_16737.p',dt_k5_finsub_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.tbJCWAvnUA/E---3.1_16737.p',d3_tarski) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.tbJCWAvnUA/E---3.1_16737.p',reflexivity_r1_tarski) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> subset(finite_subsets(X1),finite_subsets(X2)) ),
inference(assume_negation,[status(cth)],[t23_finsub_1]) ).
fof(c_0_7,plain,
! [X47,X48,X49] :
( ~ subset(X47,X48)
| ~ subset(X48,X49)
| subset(X47,X49) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_8,negated_conjecture,
( subset(esk13_0,esk14_0)
& ~ subset(finite_subsets(esk13_0),finite_subsets(esk14_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_9,plain,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
subset(esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X19,X20,X21,X22] :
( ( subset(X21,X19)
| ~ in(X21,X20)
| X20 != finite_subsets(X19)
| ~ preboolean(X20) )
& ( finite(X21)
| ~ in(X21,X20)
| X20 != finite_subsets(X19)
| ~ preboolean(X20) )
& ( ~ subset(X22,X19)
| ~ finite(X22)
| in(X22,X20)
| X20 != finite_subsets(X19)
| ~ preboolean(X20) )
& ( ~ in(esk2_2(X19,X20),X20)
| ~ subset(esk2_2(X19,X20),X19)
| ~ finite(esk2_2(X19,X20))
| X20 = finite_subsets(X19)
| ~ preboolean(X20) )
& ( subset(esk2_2(X19,X20),X19)
| in(esk2_2(X19,X20),X20)
| X20 = finite_subsets(X19)
| ~ preboolean(X20) )
& ( finite(esk2_2(X19,X20))
| in(esk2_2(X19,X20),X20)
| X20 = finite_subsets(X19)
| ~ preboolean(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)],[d5_finsub_1])])])])])])]) ).
fof(c_0_12,plain,
! [X24] : preboolean(finite_subsets(X24)),
inference(variable_rename,[status(thm)],[dt_k5_finsub_1]) ).
cnf(c_0_13,negated_conjecture,
( subset(X1,esk14_0)
| ~ subset(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ in(X1,X3)
| X3 != finite_subsets(X2)
| ~ preboolean(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
preboolean(finite_subsets(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X13,X14,X15,X16,X17] :
( ( ~ subset(X13,X14)
| ~ in(X15,X13)
| in(X15,X14) )
& ( in(esk1_2(X16,X17),X16)
| subset(X16,X17) )
& ( ~ in(esk1_2(X16,X17),X17)
| subset(X16,X17) ) ),
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_17,negated_conjecture,
( subset(X1,esk14_0)
| ~ subset(X2,esk13_0)
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ in(X1,finite_subsets(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
~ subset(finite_subsets(esk13_0),finite_subsets(esk14_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| ~ finite(X1)
| X3 != finite_subsets(X2)
| ~ preboolean(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( finite(X1)
| ~ in(X1,X2)
| X2 != finite_subsets(X3)
| ~ preboolean(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( subset(X1,esk14_0)
| ~ subset(X1,X2)
| ~ in(X2,finite_subsets(esk13_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
in(esk1_2(finite_subsets(esk13_0),finite_subsets(esk14_0)),finite_subsets(esk13_0)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_25,plain,
! [X44] : subset(X44,X44),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_26,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_21]),c_0_15])]) ).
cnf(c_0_27,plain,
( finite(X1)
| ~ in(X1,finite_subsets(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_22]),c_0_15])]) ).
cnf(c_0_28,negated_conjecture,
( subset(X1,esk14_0)
| ~ subset(X1,esk1_2(finite_subsets(esk13_0),finite_subsets(esk14_0))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,plain,
( in(X1,finite_subsets(X2))
| ~ subset(X1,X2)
| ~ in(X1,finite_subsets(X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
subset(esk1_2(finite_subsets(esk13_0),finite_subsets(esk14_0)),esk14_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ in(esk1_2(finite_subsets(esk13_0),finite_subsets(esk14_0)),finite_subsets(esk14_0)),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
~ in(esk1_2(finite_subsets(esk13_0),finite_subsets(esk14_0)),finite_subsets(X1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_24,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU110+1 : TPTP v8.1.2. Released v3.2.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 08:00:20 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.tbJCWAvnUA/E---3.1_16737.p
% 0.22/0.53 # Version: 3.1.0
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16839 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.22/0.53 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.22/0.53 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 16852 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.22/0.53 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.22/0.53 # Preprocessing time : 0.002 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 34
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 70
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 70
% 0.22/0.53 # Processed clauses : 308
% 0.22/0.53 # ...of these trivial : 3
% 0.22/0.53 # ...subsumed : 63
% 0.22/0.53 # ...remaining for further processing : 242
% 0.22/0.53 # Other redundant clauses eliminated : 3
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 4
% 0.22/0.53 # Backward-rewritten : 3
% 0.22/0.53 # Generated clauses : 453
% 0.22/0.53 # ...of the previous two non-redundant : 402
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 449
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 3
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 62
% 0.22/0.53 # ...of those cached : 37
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 163
% 0.22/0.53 # Positive orientable unit clauses : 41
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 21
% 0.22/0.53 # Non-unit-clauses : 101
% 0.22/0.53 # Current number of unprocessed clauses: 228
% 0.22/0.53 # ...number of literals in the above : 591
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 76
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 1235
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 923
% 0.22/0.53 # Non-unit clause-clause subsumptions : 47
% 0.22/0.53 # Unit Clause-clause subsumption calls : 291
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 15
% 0.22/0.53 # BW rewrite match successes : 3
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 8299
% 0.22/0.53 # Search garbage collected termcells : 653
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.022 s
% 0.22/0.53 # System time : 0.006 s
% 0.22/0.53 # Total time : 0.028 s
% 0.22/0.53 # Maximum resident set size: 1880 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.111 s
% 0.22/0.53 # System time : 0.011 s
% 0.22/0.53 # Total time : 0.122 s
% 0.22/0.53 # Maximum resident set size: 1724 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------