TSTP Solution File: SEU118+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU118+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:46 EDT 2023
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 81 ( 8 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 89 ( 34 ~; 35 |; 9 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 1 sgn; 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t34_finsub_1,conjecture,
! [X1,X2] :
( element(X2,powerset(X1))
=> ( finite(X1)
=> element(X2,finite_subsets(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.dlavLAmDRl/E---3.1_1257.p',t34_finsub_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.dlavLAmDRl/E---3.1_1257.p',d5_finsub_1) ).
fof(dt_k5_finsub_1,axiom,
! [X1] : preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox/tmp/tmp.dlavLAmDRl/E---3.1_1257.p',dt_k5_finsub_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.dlavLAmDRl/E---3.1_1257.p',t3_subset) ).
fof(cc2_finset_1,axiom,
! [X1] :
( finite(X1)
=> ! [X2] :
( element(X2,powerset(X1))
=> finite(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.dlavLAmDRl/E---3.1_1257.p',cc2_finset_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.dlavLAmDRl/E---3.1_1257.p',t1_subset) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(X1))
=> ( finite(X1)
=> element(X2,finite_subsets(X1)) ) ),
inference(assume_negation,[status(cth)],[t34_finsub_1]) ).
fof(c_0_7,plain,
! [X32,X33,X34,X35] :
( ( subset(X34,X32)
| ~ in(X34,X33)
| X33 != finite_subsets(X32)
| ~ preboolean(X33) )
& ( finite(X34)
| ~ in(X34,X33)
| X33 != finite_subsets(X32)
| ~ preboolean(X33) )
& ( ~ subset(X35,X32)
| ~ finite(X35)
| in(X35,X33)
| X33 != finite_subsets(X32)
| ~ preboolean(X33) )
& ( ~ in(esk8_2(X32,X33),X33)
| ~ subset(esk8_2(X32,X33),X32)
| ~ finite(esk8_2(X32,X33))
| X33 = finite_subsets(X32)
| ~ preboolean(X33) )
& ( subset(esk8_2(X32,X33),X32)
| in(esk8_2(X32,X33),X33)
| X33 = finite_subsets(X32)
| ~ preboolean(X33) )
& ( finite(esk8_2(X32,X33))
| in(esk8_2(X32,X33),X33)
| X33 = finite_subsets(X32)
| ~ preboolean(X33) ) ),
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_8,plain,
! [X37] : preboolean(finite_subsets(X37)),
inference(variable_rename,[status(thm)],[dt_k5_finsub_1]) ).
fof(c_0_9,plain,
! [X24,X25] :
( ( ~ element(X24,powerset(X25))
| subset(X24,X25) )
& ( ~ subset(X24,X25)
| element(X24,powerset(X25)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_10,negated_conjecture,
( element(esk2_0,powerset(esk1_0))
& finite(esk1_0)
& ~ element(esk2_0,finite_subsets(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_11,plain,
! [X6,X7] :
( ~ finite(X6)
| ~ element(X7,powerset(X6))
| finite(X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_finset_1])])]) ).
cnf(c_0_12,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| ~ finite(X1)
| X3 != finite_subsets(X2)
| ~ preboolean(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
preboolean(finite_subsets(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( finite(X2)
| ~ finite(X1)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
finite(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X20,X21] :
( ~ in(X20,X21)
| element(X20,X21) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_19,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_12]),c_0_13])]) ).
cnf(c_0_20,negated_conjecture,
subset(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
finite(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_17])]) ).
cnf(c_0_22,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
in(esk2_0,finite_subsets(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
~ element(esk2_0,finite_subsets(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU118+1 : TPTP v8.1.2. Released v3.2.0.
% 0.15/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n011.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.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 08:07:53 EDT 2023
% 0.15/0.36 % 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.dlavLAmDRl/E---3.1_1257.p
% 0.22/0.51 # Version: 3.1pre001
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # sh5l with pid 1395 completed with status 0
% 0.22/0.51 # Result found by sh5l
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.22/0.51 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 1400 completed with status 0
% 0.22/0.51 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.22/0.51 # Preprocessing time : 0.002 s
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 33
% 0.22/0.51 # Removed by relevancy pruning/SinE : 3
% 0.22/0.51 # Initial clauses : 56
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 56
% 0.22/0.51 # Processed clauses : 93
% 0.22/0.51 # ...of these trivial : 4
% 0.22/0.51 # ...subsumed : 8
% 0.22/0.51 # ...remaining for further processing : 81
% 0.22/0.51 # Other redundant clauses eliminated : 3
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 97
% 0.22/0.51 # ...of the previous two non-redundant : 72
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 94
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 3
% 0.22/0.51 # Total rewrite steps : 29
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 78
% 0.22/0.51 # Positive orientable unit clauses : 31
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 9
% 0.22/0.51 # Non-unit-clauses : 38
% 0.22/0.51 # Current number of unprocessed clauses: 35
% 0.22/0.51 # ...number of literals in the above : 74
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 0
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 100
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 66
% 0.22/0.51 # Non-unit clause-clause subsumptions : 2
% 0.22/0.51 # Unit Clause-clause subsumption calls : 53
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 13
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 3333
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.009 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.012 s
% 0.22/0.51 # Maximum resident set size: 1884 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.012 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.014 s
% 0.22/0.51 # Maximum resident set size: 1700 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------