TSTP Solution File: NUM560+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM560+2 : TPTP v8.2.0. Released v4.0.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:14:42 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 3 unt; 0 def)
% Number of atoms : 30 ( 4 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 32 ( 9 ~; 7 |; 10 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aSet0(sdtlbdtrb0(xF,xy))
& ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xF,xy))
<=> ( aElementOf0(X1,szDzozmdt0(xF))
& sdtlpdtrp0(xF,X1) = xy ) ) )
=> ( ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xF,xy))
=> aElementOf0(X1,szDzozmdt0(xF)) )
| aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(c_0_1,negated_conjecture,
~ ( ( aSet0(sdtlbdtrb0(xF,xy))
& ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xF,xy))
<=> ( aElementOf0(X1,szDzozmdt0(xF))
& sdtlpdtrp0(xF,X1) = xy ) ) )
=> ( ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xF,xy))
=> aElementOf0(X1,szDzozmdt0(xF)) )
| aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_2,negated_conjecture,
! [X5] :
( aSet0(sdtlbdtrb0(xF,xy))
& ( aElementOf0(X5,szDzozmdt0(xF))
| ~ aElementOf0(X5,sdtlbdtrb0(xF,xy)) )
& ( sdtlpdtrp0(xF,X5) = xy
| ~ aElementOf0(X5,sdtlbdtrb0(xF,xy)) )
& ( ~ aElementOf0(X5,szDzozmdt0(xF))
| sdtlpdtrp0(xF,X5) != xy
| aElementOf0(X5,sdtlbdtrb0(xF,xy)) )
& aElementOf0(esk1_0,sdtlbdtrb0(xF,xy))
& ~ aElementOf0(esk1_0,szDzozmdt0(xF))
& ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( aElementOf0(X1,szDzozmdt0(xF))
| ~ aElementOf0(X1,sdtlbdtrb0(xF,xy)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
aElementOf0(esk1_0,sdtlbdtrb0(xF,xy)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ aElementOf0(esk1_0,szDzozmdt0(xF)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM560+2 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 04:08:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 20945 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGUSF-FFMS32-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.20/0.49 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 20948 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.20/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGUSF-FFMS32-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.002 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 68
% 0.20/0.49 # Removed by relevancy pruning/SinE : 53
% 0.20/0.49 # Initial clauses : 31
% 0.20/0.49 # Removed in clause preprocessing : 4
% 0.20/0.49 # Initial clauses in saturation : 27
% 0.20/0.49 # Processed clauses : 38
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 38
% 0.20/0.49 # Other redundant clauses eliminated : 5
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 5
% 0.20/0.49 # ...of the previous two non-redundant : 4
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 4
% 0.20/0.49 # Paramodulations : 1
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 5
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 0
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 7
% 0.20/0.49 # Positive orientable unit clauses : 4
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 1
% 0.20/0.49 # Current number of unprocessed clauses: 20
% 0.20/0.49 # ...number of literals in the above : 75
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 27
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 104
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 32
% 0.20/0.49 # Non-unit clause-clause subsumptions : 4
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3265
% 0.20/0.49 # Search garbage collected termcells : 1005
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1884 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.010 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.014 s
% 0.20/0.49 # Maximum resident set size: 1768 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------