TSTP Solution File: SEU089+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU089+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:21 EDT 2023
% Result : Timeout 0.28s 300.11s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 9 unt; 0 def)
% Number of atoms : 33 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 27 ( 10 ~; 6 |; 8 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 24 ( 0 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t20_finset_1,conjecture,
! [X1,X2,X3] :
( ( finite(X1)
& finite(X2)
& finite(X3) )
=> finite(cartesian_product3(X1,X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.lzBHFBmBlZ/E---3.1_14123.p',t20_finset_1) ).
fof(fc14_finset_1,axiom,
! [X1,X2] :
( ( finite(X1)
& finite(X2) )
=> finite(cartesian_product2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.lzBHFBmBlZ/E---3.1_14123.p',fc14_finset_1) ).
fof(d3_zfmisc_1,axiom,
! [X1,X2,X3] : cartesian_product3(X1,X2,X3) = cartesian_product2(cartesian_product2(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.lzBHFBmBlZ/E---3.1_14123.p',d3_zfmisc_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( finite(X1)
& finite(X2)
& finite(X3) )
=> finite(cartesian_product3(X1,X2,X3)) ),
inference(assume_negation,[status(cth)],[t20_finset_1]) ).
fof(c_0_4,plain,
! [X35,X36] :
( ~ finite(X35)
| ~ finite(X36)
| finite(cartesian_product2(X35,X36)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc14_finset_1])]) ).
fof(c_0_5,plain,
! [X13,X14,X15] : cartesian_product3(X13,X14,X15) = cartesian_product2(cartesian_product2(X13,X14),X15),
inference(variable_rename,[status(thm)],[d3_zfmisc_1]) ).
fof(c_0_6,negated_conjecture,
( finite(esk1_0)
& finite(esk2_0)
& finite(esk3_0)
& ~ finite(cartesian_product3(esk1_0,esk2_0,esk3_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_7,plain,
( finite(cartesian_product2(X1,X2))
| ~ finite(X1)
| ~ finite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
cartesian_product3(X1,X2,X3) = cartesian_product2(cartesian_product2(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ finite(cartesian_product3(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( finite(cartesian_product3(X1,X2,X3))
| ~ finite(cartesian_product2(X1,X2))
| ~ finite(X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
finite(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
~ finite(cartesian_product2(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_13,negated_conjecture,
finite(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
finite(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_7]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU089+1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 08:32:08 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.43 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.lzBHFBmBlZ/E---3.1_14123.p
% 0.28/300.11 # Version: 3.1pre001
% 0.28/300.11 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.11 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/300.11 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.11 # Starting new_bool_1 with 300s (1) cores
% 0.28/300.11 # Starting sh5l with 300s (1) cores
% 0.28/300.11 # new_bool_3 with pid 14256 completed with status 0
% 0.28/300.11 # Result found by new_bool_3
% 0.28/300.11 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.11 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/300.11 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/300.11 # Search class: FGUSM-FFMM31-SFFFFFNN
% 0.28/300.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/300.11 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.28/300.11 # SAT001_MinMin_p005000_rr_RG with pid 14263 completed with status 0
% 0.28/300.11 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.28/300.11 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.11 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/300.11 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/300.11 # Search class: FGUSM-FFMM31-SFFFFFNN
% 0.28/300.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/300.11 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.28/300.11 # Preprocessing time : 0.001 s
% 0.28/300.11 # Presaturation interreduction done
% 0.28/300.11
% 0.28/300.11 # Proof found!
% 0.28/300.11 # SZS status Theorem
% 0.28/300.11 # SZS output start CNFRefutation
% See solution above
% 0.28/300.11 # Parsed axioms : 60
% 0.28/300.11 # Removed by relevancy pruning/SinE : 31
% 0.28/300.11 # Initial clauses : 52
% 0.28/300.11 # Removed in clause preprocessing : 0
% 0.28/300.11 # Initial clauses in saturation : 52
% 0.28/300.11 # Processed clauses : 135
% 0.28/300.11 # ...of these trivial : 0
% 0.28/300.11 # ...subsumed : 7
% 0.28/300.11 # ...remaining for further processing : 128
% 0.28/300.11 # Other redundant clauses eliminated : 0
% 0.28/300.11 # Clauses deleted for lack of memory : 0
% 0.28/300.11 # Backward-subsumed : 0
% 0.28/300.11 # Backward-rewritten : 7
% 0.28/300.11 # Generated clauses : 65
% 0.28/300.11 # ...of the previous two non-redundant : 58
% 0.28/300.11 # ...aggressively subsumed : 0
% 0.28/300.11 # Contextual simplify-reflections : 0
% 0.28/300.11 # Paramodulations : 65
% 0.28/300.11 # Factorizations : 0
% 0.28/300.11 # NegExts : 0
% 0.28/300.11 # Equation resolutions : 0
% 0.28/300.11 # Total rewrite steps : 25
% 0.28/300.11 # Propositional unsat checks : 0
% 0.28/300.11 # Propositional check models : 0
% 0.28/300.11 # Propositional check unsatisfiable : 0
% 0.28/300.11 # Propositional clauses : 0
% 0.28/300.11 # Propositional clauses after purity: 0
% 0.28/300.11 # Propositional unsat core size : 0
% 0.28/300.11 # Propositional preprocessing time : 0.000
% 0.28/300.11 # Propositional encoding time : 0.000
% 0.28/300.11 # Propositional solver time : 0.000
% 0.28/300.11 # Success case prop preproc time : 0.000
% 0.28/300.11 # Success case prop encoding time : 0.000
% 0.28/300.11 # Success case prop solver time : 0.000
% 0.28/300.11 # Current number of processed clauses : 70
% 0.28/300.11 # Positive orientable unit clauses : 26
% 0.28/300.11 # Positive unorientable unit clauses: 0
% 0.28/300.11 # Negative unit clauses : 8
% 0.28/300.11 # Non-unit-clauses : 36
% 0.28/300.11 # Current number of unprocessed clauses: 13
% 0.28/300.11 # ...number of literals in the above : 34
% 0.28/300.11 # Current number of archived formulas : 0
% 0.28/300.11 # Current number of archived clauses : 58
% 0.28/300.11 # Clause-clause subsumption calls (NU) : 105
% 0.28/300.11 # Rec. Clause-clause subsumption calls : 97
% 0.28/300.11 # Non-unit clause-clause subsumptions : 4
% 0.28/300.11 # Unit Clause-clause subsumption calls : 31
% 0.28/300.11 # Rewrite failures with RHS unbound : 0
% 0.28/300.11 # BW rewrite match attempts : 5
% 0.28/300.11 # BW rewrite match successes : 4
% 0.28/300.11 # Condensation attempts : 0
% 0.28/300.11 # Condensation successes : 0
% 0.28/300.11 # Termbank termtop insertions : 3226
% 0.28/300.11
% 0.28/300.11 # -------------------------------------------------
% 0.28/300.11 # User time : 0.006 s
% 0.28/300.11 # System time : 0.003 s
% 0.28/300.11 # Total time : 0.009 s
% 0.28/300.11 # Maximum resident set size: 1884 pages
% 0.28/300.11
% 0.28/300.11 # -------------------------------------------------
% 0.28/300.11 # User time : 0.009 s
% 0.28/300.11 # System time : 0.004 s
% 0.28/300.11 # Total time : 0.012 s
% 0.28/300.11 # Maximum resident set size: 1732 pages
% 0.28/300.11 % E---3.1 exiting
%------------------------------------------------------------------------------