TSTP Solution File: NUM531+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM531+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 18:56:13 EDT 2023
% Result : Timeout 408.10s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 32 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 31 ( 14 ~; 4 |; 9 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn; 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ ( ~ ? [X2] : aElementOf0(X2,X1)
& X1 = slcrc0 ) ),
file('/export/starexec/sandbox/tmp/tmp.f7K2uIN1dH/E---3.1_23538.p',m__) ).
fof(mCountNFin,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.f7K2uIN1dH/E---3.1_23538.p',mCountNFin) ).
fof(mEmpFin,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox/tmp/tmp.f7K2uIN1dH/E---3.1_23538.p',mEmpFin) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ ( ~ ? [X2] : aElementOf0(X2,X1)
& X1 = slcrc0 ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,plain,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ isFinite0(X1) ),
inference(fof_simplification,[status(thm)],[mCountNFin]) ).
fof(c_0_5,negated_conjecture,
! [X4] :
( aSet0(esk1_0)
& isCountable0(esk1_0)
& ~ aElementOf0(X4,esk1_0)
& esk1_0 = slcrc0 ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,plain,
! [X11] :
( ~ aSet0(X11)
| ~ isCountable0(X11)
| ~ isFinite0(X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_7,negated_conjecture,
isCountable0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = slcrc0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
aSet0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ aSet0(X1)
| ~ isCountable0(X1)
| ~ isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
isCountable0(slcrc0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
isFinite0(slcrc0),
inference(split_conjunct,[status(thm)],[mEmpFin]) ).
cnf(c_0_13,negated_conjecture,
aSet0(slcrc0),
inference(rw,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM531+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n025.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 14:42:21 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.f7K2uIN1dH/E---3.1_23538.p
% 408.10/300.16 # Version: 3.1pre001
% 408.10/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.10/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.10/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.10/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.10/300.16 # Starting new_bool_1 with 300s (1) cores
% 408.10/300.16 # Starting sh5l with 300s (1) cores
% 408.10/300.16 # new_bool_3 with pid 23617 completed with status 0
% 408.10/300.16 # Result found by new_bool_3
% 408.10/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.10/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.10/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.10/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.10/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.10/300.16 # Search class: FGHSF-FFSS11-SFFFFFNN
% 408.10/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.10/300.16 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.10/300.16 # SAT001_MinMin_p005000_rr_RG with pid 23622 completed with status 0
% 408.10/300.16 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.10/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.10/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.10/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.10/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.10/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.10/300.16 # Search class: FGHSF-FFSS11-SFFFFFNN
% 408.10/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.10/300.16 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.10/300.16 # Preprocessing time : 0.001 s
% 408.10/300.16 # Presaturation interreduction done
% 408.10/300.16
% 408.10/300.16 # Proof found!
% 408.10/300.16 # SZS status Theorem
% 408.10/300.16 # SZS output start CNFRefutation
% See solution above
% 408.10/300.16 # Parsed axioms : 9
% 408.10/300.16 # Removed by relevancy pruning/SinE : 0
% 408.10/300.16 # Initial clauses : 14
% 408.10/300.16 # Removed in clause preprocessing : 4
% 408.10/300.16 # Initial clauses in saturation : 10
% 408.10/300.16 # Processed clauses : 19
% 408.10/300.16 # ...of these trivial : 0
% 408.10/300.16 # ...subsumed : 1
% 408.10/300.16 # ...remaining for further processing : 18
% 408.10/300.16 # Other redundant clauses eliminated : 2
% 408.10/300.16 # Clauses deleted for lack of memory : 0
% 408.10/300.16 # Backward-subsumed : 0
% 408.10/300.16 # Backward-rewritten : 0
% 408.10/300.16 # Generated clauses : 4
% 408.10/300.16 # ...of the previous two non-redundant : 2
% 408.10/300.16 # ...aggressively subsumed : 0
% 408.10/300.16 # Contextual simplify-reflections : 0
% 408.10/300.16 # Paramodulations : 2
% 408.10/300.16 # Factorizations : 0
% 408.10/300.16 # NegExts : 0
% 408.10/300.16 # Equation resolutions : 2
% 408.10/300.16 # Total rewrite steps : 6
% 408.10/300.16 # Propositional unsat checks : 0
% 408.10/300.16 # Propositional check models : 0
% 408.10/300.16 # Propositional check unsatisfiable : 0
% 408.10/300.16 # Propositional clauses : 0
% 408.10/300.16 # Propositional clauses after purity: 0
% 408.10/300.16 # Propositional unsat core size : 0
% 408.10/300.16 # Propositional preprocessing time : 0.000
% 408.10/300.16 # Propositional encoding time : 0.000
% 408.10/300.16 # Propositional solver time : 0.000
% 408.10/300.16 # Success case prop preproc time : 0.000
% 408.10/300.16 # Success case prop encoding time : 0.000
% 408.10/300.16 # Success case prop solver time : 0.000
% 408.10/300.16 # Current number of processed clauses : 8
% 408.10/300.16 # Positive orientable unit clauses : 4
% 408.10/300.16 # Positive unorientable unit clauses: 0
% 408.10/300.16 # Negative unit clauses : 1
% 408.10/300.16 # Non-unit-clauses : 3
% 408.10/300.16 # Current number of unprocessed clauses: 1
% 408.10/300.16 # ...number of literals in the above : 3
% 408.10/300.16 # Current number of archived formulas : 0
% 408.10/300.16 # Current number of archived clauses : 8
% 408.10/300.16 # Clause-clause subsumption calls (NU) : 0
% 408.10/300.16 # Rec. Clause-clause subsumption calls : 0
% 408.10/300.16 # Non-unit clause-clause subsumptions : 0
% 408.10/300.16 # Unit Clause-clause subsumption calls : 0
% 408.10/300.16 # Rewrite failures with RHS unbound : 0
% 408.10/300.16 # BW rewrite match attempts : 0
% 408.10/300.16 # BW rewrite match successes : 0
% 408.10/300.16 # Condensation attempts : 0
% 408.10/300.16 # Condensation successes : 0
% 408.10/300.16 # Termbank termtop insertions : 542
% 408.10/300.16
% 408.10/300.16 # -------------------------------------------------
% 408.10/300.16 # User time : 0.002 s
% 408.10/300.16 # System time : 0.002 s
% 408.10/300.16 # Total time : 0.005 s
% 408.10/300.16 # Maximum resident set size: 1748 pages
% 408.10/300.16
% 408.10/300.16 # -------------------------------------------------
% 408.10/300.16 # User time : 0.005 s
% 408.10/300.16 # System time : 0.003 s
% 408.10/300.16 # Total time : 0.007 s
% 408.10/300.16 # Maximum resident set size: 1672 pages
% 408.10/300.16 % E---3.1 exiting
% 408.10/300.17 % E---3.1 exiting
%------------------------------------------------------------------------------