TSTP Solution File: SEU096+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU096+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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:24:43 EDT 2023
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 48 ( 4 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 47 ( 16 ~; 13 |; 11 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 17 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t27_finset_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ( subset(X1,relation_rng(X2))
& finite(relation_inverse_image(X2,X1)) )
=> finite(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.bwaFJy76wC/E---3.1_4859.p',t27_finset_1) ).
fof(fc13_finset_1,axiom,
! [X1,X2] :
( ( relation(X1)
& function(X1)
& finite(X2) )
=> finite(relation_image(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.bwaFJy76wC/E---3.1_4859.p',fc13_finset_1) ).
fof(t147_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( subset(X1,relation_rng(X2))
=> relation_image(X2,relation_inverse_image(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.bwaFJy76wC/E---3.1_4859.p',t147_funct_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ( subset(X1,relation_rng(X2))
& finite(relation_inverse_image(X2,X1)) )
=> finite(X1) ) ),
inference(assume_negation,[status(cth)],[t27_finset_1]) ).
fof(c_0_4,plain,
! [X44,X45] :
( ~ relation(X44)
| ~ function(X44)
| ~ finite(X45)
| finite(relation_image(X44,X45)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc13_finset_1])]) ).
fof(c_0_5,negated_conjecture,
( relation(esk2_0)
& function(esk2_0)
& subset(esk1_0,relation_rng(esk2_0))
& finite(relation_inverse_image(esk2_0,esk1_0))
& ~ finite(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,plain,
! [X12,X13] :
( ~ relation(X13)
| ~ function(X13)
| ~ subset(X12,relation_rng(X13))
| relation_image(X13,relation_inverse_image(X13,X12)) = X12 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t147_funct_1])]) ).
cnf(c_0_7,plain,
( finite(relation_image(X1,X2))
| ~ relation(X1)
| ~ function(X1)
| ~ finite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( relation_image(X1,relation_inverse_image(X1,X2)) = X2
| ~ relation(X1)
| ~ function(X1)
| ~ subset(X2,relation_rng(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
subset(esk1_0,relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( finite(relation_image(esk2_0,X1))
| ~ finite(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_13,negated_conjecture,
finite(relation_inverse_image(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
relation_image(esk2_0,relation_inverse_image(esk2_0,esk1_0)) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8]),c_0_9])]) ).
cnf(c_0_15,negated_conjecture,
~ finite(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SEU096+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n005.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 08:52:01 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.bwaFJy76wC/E---3.1_4859.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # new_bool_3 with pid 4938 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.16/0.45 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 4941 completed with status 0
% 0.16/0.45 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 60
% 0.16/0.45 # Removed by relevancy pruning/SinE : 23
% 0.16/0.45 # Initial clauses : 63
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 63
% 0.16/0.45 # Processed clauses : 128
% 0.16/0.45 # ...of these trivial : 9
% 0.16/0.45 # ...subsumed : 8
% 0.16/0.45 # ...remaining for further processing : 111
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 32
% 0.16/0.45 # Generated clauses : 147
% 0.16/0.45 # ...of the previous two non-redundant : 131
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 147
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Total rewrite steps : 106
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 79
% 0.16/0.45 # Positive orientable unit clauses : 30
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 7
% 0.16/0.45 # Non-unit-clauses : 42
% 0.16/0.45 # Current number of unprocessed clauses: 52
% 0.16/0.45 # ...number of literals in the above : 101
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 32
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 118
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 110
% 0.16/0.45 # Non-unit clause-clause subsumptions : 5
% 0.16/0.45 # Unit Clause-clause subsumption calls : 160
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 5
% 0.16/0.45 # BW rewrite match successes : 4
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 4070
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.007 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.009 s
% 0.16/0.45 # Maximum resident set size: 1888 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.009 s
% 0.16/0.45 # System time : 0.004 s
% 0.16/0.45 # Total time : 0.013 s
% 0.16/0.45 # Maximum resident set size: 1720 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------