TSTP Solution File: NUM561+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM561+1 : TPTP v8.1.2. Released v4.0.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:06:43 EDT 2024
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 79 ( 15 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 102 ( 44 ~; 44 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-4 aty)
% Number of variables : 27 ( 0 sgn 16 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
file('/export/starexec/sandbox/tmp/tmp.FOVXK8g09m/E---3.1_3664.p',m__) ).
fof(mDefSImg,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aSubsetOf0(X2,szDzozmdt0(X1))
=> ! [X3] :
( X3 = sdtlcdtrc0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5] :
( aElementOf0(X5,X2)
& sdtlpdtrp0(X1,X5) = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FOVXK8g09m/E---3.1_3664.p',mDefSImg) ).
fof(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.FOVXK8g09m/E---3.1_3664.p',mDomSet) ).
fof(m__2911,hypothesis,
aFunction0(xF),
file('/export/starexec/sandbox/tmp/tmp.FOVXK8g09m/E---3.1_3664.p',m__2911) ).
fof(m__2911_02,hypothesis,
aElementOf0(xx,szDzozmdt0(xF)),
file('/export/starexec/sandbox/tmp/tmp.FOVXK8g09m/E---3.1_3664.p',m__2911_02) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.FOVXK8g09m/E---3.1_3664.p',mSubRefl) ).
fof(c_0_6,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_7,plain,
! [X8,X9,X10,X11,X13,X14,X15,X17] :
( ( aSet0(X10)
| X10 != sdtlcdtrc0(X8,X9)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| ~ aFunction0(X8) )
& ( aElementOf0(esk1_4(X8,X9,X10,X11),X9)
| ~ aElementOf0(X11,X10)
| X10 != sdtlcdtrc0(X8,X9)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| ~ aFunction0(X8) )
& ( sdtlpdtrp0(X8,esk1_4(X8,X9,X10,X11)) = X11
| ~ aElementOf0(X11,X10)
| X10 != sdtlcdtrc0(X8,X9)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| ~ aFunction0(X8) )
& ( ~ aElementOf0(X14,X9)
| sdtlpdtrp0(X8,X14) != X13
| aElementOf0(X13,X10)
| X10 != sdtlcdtrc0(X8,X9)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| ~ aFunction0(X8) )
& ( ~ aElementOf0(esk2_3(X8,X9,X15),X15)
| ~ aElementOf0(X17,X9)
| sdtlpdtrp0(X8,X17) != esk2_3(X8,X9,X15)
| ~ aSet0(X15)
| X15 = sdtlcdtrc0(X8,X9)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| ~ aFunction0(X8) )
& ( aElementOf0(esk3_3(X8,X9,X15),X9)
| aElementOf0(esk2_3(X8,X9,X15),X15)
| ~ aSet0(X15)
| X15 = sdtlcdtrc0(X8,X9)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| ~ aFunction0(X8) )
& ( sdtlpdtrp0(X8,esk3_3(X8,X9,X15)) = esk2_3(X8,X9,X15)
| aElementOf0(esk2_3(X8,X9,X15),X15)
| ~ aSet0(X15)
| X15 = sdtlcdtrc0(X8,X9)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| ~ aFunction0(X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSImg])])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( aElementOf0(X4,X5)
| ~ aElementOf0(X1,X2)
| sdtlpdtrp0(X3,X1) != X4
| X5 != sdtlcdtrc0(X3,X2)
| ~ aSubsetOf0(X2,szDzozmdt0(X3))
| ~ aFunction0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X7] :
( ~ aFunction0(X7)
| aSet0(szDzozmdt0(X7)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])])]) ).
cnf(c_0_11,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,X3))
| ~ aFunction0(X1)
| ~ aSubsetOf0(X3,szDzozmdt0(X1))
| ~ aElementOf0(X2,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,hypothesis,
aFunction0(xF),
inference(split_conjunct,[status(thm)],[m__2911]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xx,szDzozmdt0(xF)),
inference(split_conjunct,[status(thm)],[m__2911_02]) ).
fof(c_0_15,plain,
! [X29] :
( ~ aSet0(X29)
| aSubsetOf0(X29,X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])])]) ).
cnf(c_0_16,plain,
( aSet0(szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_18,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,hypothesis,
aSet0(szDzozmdt0(xF)),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : NUM561+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n004.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 09:11:48 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.FOVXK8g09m/E---3.1_3664.p
% 0.15/0.42 # Version: 3.1.0
% 0.15/0.42 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_3 with pid 3743 completed with status 0
% 0.15/0.42 # Result found by new_bool_3
% 0.15/0.42 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGUSF-FFMF32-SFFFFFNN
% 0.15/0.42 # partial match(1): FGHSF-FFMF32-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.42 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3747 completed with status 0
% 0.15/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.42 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGUSF-FFMF32-SFFFFFNN
% 0.15/0.42 # partial match(1): FGHSF-FFMF32-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 71
% 0.15/0.42 # Removed by relevancy pruning/SinE : 55
% 0.15/0.42 # Initial clauses : 25
% 0.15/0.42 # Removed in clause preprocessing : 4
% 0.15/0.42 # Initial clauses in saturation : 21
% 0.15/0.42 # Processed clauses : 46
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 0
% 0.15/0.42 # ...remaining for further processing : 46
% 0.15/0.42 # Other redundant clauses eliminated : 5
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 0
% 0.15/0.42 # Generated clauses : 18
% 0.15/0.42 # ...of the previous two non-redundant : 14
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 3
% 0.15/0.42 # Paramodulations : 14
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 5
% 0.15/0.42 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 4
% 0.15/0.43 # ...of those cached : 1
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 21
% 0.15/0.43 # Positive orientable unit clauses : 4
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 2
% 0.15/0.43 # Non-unit-clauses : 15
% 0.15/0.43 # Current number of unprocessed clauses: 10
% 0.15/0.43 # ...number of literals in the above : 52
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 21
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 113
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 38
% 0.15/0.43 # Non-unit clause-clause subsumptions : 3
% 0.15/0.43 # Unit Clause-clause subsumption calls : 7
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 0
% 0.15/0.43 # BW rewrite match successes : 0
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 3328
% 0.15/0.43 # Search garbage collected termcells : 967
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.006 s
% 0.15/0.43 # System time : 0.001 s
% 0.15/0.43 # Total time : 0.007 s
% 0.15/0.43 # Maximum resident set size: 1872 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.008 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.011 s
% 0.15/0.43 # Maximum resident set size: 1772 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------