TSTP Solution File: SEU294+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU294+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:31:20 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 27 ( 10 ~; 7 |; 5 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_finset_1,conjecture,
! [X1,X2] :
( ( subset(X1,X2)
& finite(X2) )
=> finite(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.sMlMjZelE6/E---3.1_2228.p',t13_finset_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.sMlMjZelE6/E---3.1_2228.p',t3_subset) ).
fof(cc2_finset_1,axiom,
! [X1] :
( finite(X1)
=> ! [X2] :
( element(X2,powerset(X1))
=> finite(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sMlMjZelE6/E---3.1_2228.p',cc2_finset_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ( subset(X1,X2)
& finite(X2) )
=> finite(X1) ),
inference(assume_negation,[status(cth)],[t13_finset_1]) ).
fof(c_0_4,plain,
! [X15,X16] :
( ( ~ element(X15,powerset(X16))
| subset(X15,X16) )
& ( ~ subset(X15,X16)
| element(X15,powerset(X16)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_5,negated_conjecture,
( subset(esk1_0,esk2_0)
& finite(esk2_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,
! [X7,X8] :
( ~ finite(X7)
| ~ element(X8,powerset(X7))
| finite(X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_finset_1])])]) ).
cnf(c_0_7,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( finite(X2)
| ~ finite(X1)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
element(esk1_0,powerset(esk2_0)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
finite(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
~ finite(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU294+3 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.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:45 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.sMlMjZelE6/E---3.1_2228.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 2306 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSM-FFMM11-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 2313 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSM-FFMM11-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.003 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 54
% 0.20/0.51 # Removed by relevancy pruning/SinE : 5
% 0.20/0.51 # Initial clauses : 123
% 0.20/0.51 # Removed in clause preprocessing : 4
% 0.20/0.51 # Initial clauses in saturation : 119
% 0.20/0.51 # Processed clauses : 233
% 0.20/0.51 # ...of these trivial : 10
% 0.20/0.51 # ...subsumed : 5
% 0.20/0.51 # ...remaining for further processing : 218
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 24
% 0.20/0.51 # Generated clauses : 32
% 0.20/0.51 # ...of the previous two non-redundant : 18
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 3
% 0.20/0.51 # Paramodulations : 32
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 82
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 85
% 0.20/0.51 # Positive orientable unit clauses : 50
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 10
% 0.20/0.51 # Non-unit-clauses : 25
% 0.20/0.51 # Current number of unprocessed clauses: 11
% 0.20/0.51 # ...number of literals in the above : 25
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 133
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 117
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 111
% 0.20/0.51 # Non-unit clause-clause subsumptions : 8
% 0.20/0.51 # Unit Clause-clause subsumption calls : 68
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 9
% 0.20/0.51 # BW rewrite match successes : 7
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 4141
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.012 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.015 s
% 0.20/0.51 # Maximum resident set size: 1904 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.016 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.019 s
% 0.20/0.51 # Maximum resident set size: 1732 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------