TSTP Solution File: NUM455+6 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM455+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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 : 600s
% DateTime : Mon Jul 18 09:32:36 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 164 ( 42 equ)
% Maximal formula atoms : 44 ( 7 avg)
% Number of connectives : 201 ( 60 ~; 64 |; 72 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-2 aty)
% Number of variables : 28 ( 3 sgn 15 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10)) )
| aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
| sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
| aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ~ ( ( X1 = sz10
| X1 = smndt0(sz10) )
& aElementOf0(X1,cS2200) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__2232,hypothesis,
( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xp,X1) = sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)) )
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,xp),sz10,xp)
& aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ? [X1] :
( aInteger0(X1)
& sdtasdt0(xp,X1) = sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)) )
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp)
& aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2232) ).
fof(m__2258,hypothesis,
( sdtpldt0(sz10,xp) != sz10
& sdtpldt0(sz10,smndt0(xp)) != sz10 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2258) ).
fof(m__2171,hypothesis,
( aInteger0(xp)
& xp != sz00
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ! [X1] :
( ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> ( aInteger0(X1)
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10)) )
& aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
& ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10)) )
| aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
| sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ) )
& aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) )
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) )
& ! [X1] :
( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> aElementOf0(X1,stldt0(sbsmnsldt0(xS))) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2171) ).
fof(m__2286,hypothesis,
( sdtpldt0(sz10,xp) != smndt0(sz10)
| sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2286) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] :
( ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10)) )
| aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
| sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
| aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ~ ( ( X1 = sz10
| X1 = smndt0(sz10) )
& aElementOf0(X1,cS2200) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X3,X4] :
( ( X3 = sz10
| X3 = smndt0(sz10)
| ~ aInteger0(X4)
| sdtasdt0(xp,X4) != sdtpldt0(X3,smndt0(sz10))
| ~ aInteger0(X3) )
& ( aElementOf0(X3,cS2200)
| ~ aInteger0(X4)
| sdtasdt0(xp,X4) != sdtpldt0(X3,smndt0(sz10))
| ~ aInteger0(X3) )
& ( X3 = sz10
| X3 = smndt0(sz10)
| ~ aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
| ~ aInteger0(X3) )
& ( aElementOf0(X3,cS2200)
| ~ aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
| ~ aInteger0(X3) )
& ( X3 = sz10
| X3 = smndt0(sz10)
| ~ sdteqdtlpzmzozddtrp0(X3,sz10,xp)
| ~ aInteger0(X3) )
& ( aElementOf0(X3,cS2200)
| ~ sdteqdtlpzmzozddtrp0(X3,sz10,xp)
| ~ aInteger0(X3) )
& ( X3 = sz10
| X3 = smndt0(sz10)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aElementOf0(X3,cS2200)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
fof(c_0_7,hypothesis,
( aInteger0(esk13_0)
& sdtasdt0(xp,esk13_0) = sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10))
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,xp),sz10,xp)
& aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& aInteger0(esk14_0)
& sdtasdt0(xp,esk14_0) = sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10))
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp)
& aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__2232])])])]) ).
cnf(c_0_8,negated_conjecture,
( X1 = smndt0(sz10)
| X1 = sz10
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
sdtpldt0(sz10,xp) != sz10,
inference(split_conjunct,[status(thm)],[m__2258]) ).
fof(c_0_11,hypothesis,
! [X3,X3,X5,X6,X6,X8,X9,X9,X10] :
( aInteger0(xp)
& xp != sz00
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ( aInteger0(X3)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aInteger0(esk11_1(X3))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( sdtasdt0(xp,esk11_1(X3)) = sdtpldt0(X3,smndt0(sz10))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( sdteqdtlpzmzozddtrp0(X3,sz10,xp)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ aInteger0(X5)
| sdtasdt0(xp,X5) != sdtpldt0(X3,smndt0(sz10))
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ sdteqdtlpzmzozddtrp0(X3,sz10,xp)
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& aSet0(sbsmnsldt0(xS))
& ( aInteger0(X6)
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aElementOf0(esk12_1(X6),xS)
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aElementOf0(X6,esk12_1(X6))
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X6)
| ~ aElementOf0(X8,xS)
| ~ aElementOf0(X6,X8)
| aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aInteger0(X9)
| ~ aElementOf0(X9,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X9,sbsmnsldt0(xS))
| ~ aElementOf0(X9,stldt0(sbsmnsldt0(xS))) )
& ( ~ aInteger0(X9)
| aElementOf0(X9,sbsmnsldt0(xS))
| aElementOf0(X9,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X10,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| aElementOf0(X10,stldt0(sbsmnsldt0(xS))) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[m__2171])])])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( X1 = smndt0(sz10)
| X1 = sz10
| ~ aInteger0(X1)
| ~ sdteqdtlpzmzozddtrp0(X1,sz10,xp) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
smndt0(sz10) = sdtpldt0(sz10,xp),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,hypothesis,
( aInteger0(X1)
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,hypothesis,
( sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10)
| sdtpldt0(sz10,xp) != smndt0(sz10) ),
inference(split_conjunct,[status(thm)],[m__2286]) ).
cnf(c_0_17,negated_conjecture,
( X1 = sdtpldt0(sz10,xp)
| X1 = sz10
| ~ sdteqdtlpzmzozddtrp0(X1,sz10,xp)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,hypothesis,
aInteger0(sdtpldt0(sz10,smndt0(xp))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,hypothesis,
sdtpldt0(sz10,smndt0(xp)) != sdtpldt0(sz10,xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_13]),c_0_13])]) ).
cnf(c_0_21,hypothesis,
sdtpldt0(sz10,smndt0(xp)) != sz10,
inference(split_conjunct,[status(thm)],[m__2258]) ).
cnf(c_0_22,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM455+6 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n013.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 : 600
% 0.13/0.34 % DateTime : Wed Jul 6 14:47:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.43 # Preprocessing time : 0.031 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 23
% 0.24/1.43 # Proof object clause steps : 14
% 0.24/1.43 # Proof object formula steps : 9
% 0.24/1.43 # Proof object conjectures : 7
% 0.24/1.43 # Proof object clause conjectures : 4
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 9
% 0.24/1.43 # Proof object initial formulas used : 5
% 0.24/1.43 # Proof object generating inferences : 3
% 0.24/1.43 # Proof object simplifying inferences : 9
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 50
% 0.24/1.43 # Removed by relevancy pruning/SinE : 4
% 0.24/1.43 # Initial clauses : 217
% 0.24/1.43 # Removed in clause preprocessing : 5
% 0.24/1.43 # Initial clauses in saturation : 212
% 0.24/1.43 # Processed clauses : 413
% 0.24/1.43 # ...of these trivial : 33
% 0.24/1.43 # ...subsumed : 85
% 0.24/1.43 # ...remaining for further processing : 295
% 0.24/1.43 # Other redundant clauses eliminated : 7
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 0
% 0.24/1.43 # Backward-rewritten : 32
% 0.24/1.43 # Generated clauses : 1211
% 0.24/1.43 # ...of the previous two non-trivial : 1098
% 0.24/1.43 # Contextual simplify-reflections : 37
% 0.24/1.43 # Paramodulations : 1194
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 17
% 0.24/1.43 # Current number of processed clauses : 263
% 0.24/1.43 # Positive orientable unit clauses : 59
% 0.24/1.43 # Positive unorientable unit clauses: 0
% 0.24/1.43 # Negative unit clauses : 6
% 0.24/1.43 # Non-unit-clauses : 198
% 0.24/1.43 # Current number of unprocessed clauses: 646
% 0.24/1.43 # ...number of literals in the above : 3319
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 32
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 9774
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 3169
% 0.24/1.43 # Non-unit clause-clause subsumptions : 112
% 0.24/1.43 # Unit Clause-clause subsumption calls : 246
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 8
% 0.24/1.43 # BW rewrite match successes : 3
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 36368
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.099 s
% 0.24/1.43 # System time : 0.006 s
% 0.24/1.43 # Total time : 0.105 s
% 0.24/1.43 # Maximum resident set size: 4760 pages
%------------------------------------------------------------------------------