TSTP Solution File: NUM436+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM436+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:07:08 EDT 2023
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 75 ( 21 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 97 ( 41 ~; 33 |; 22 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn; 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xp,X1) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
file('/export/starexec/sandbox/tmp/tmp.SnmdwXnh8s/E---3.1_20804.p',m__) ).
fof(m__1071,hypothesis,
( sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb))
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)) ),
file('/export/starexec/sandbox/tmp/tmp.SnmdwXnh8s/E---3.1_20804.p',m__1071) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.SnmdwXnh8s/E---3.1_20804.p',mIntMult) ).
fof(m__1032,hypothesis,
( aInteger0(xm)
& sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/tmp/tmp.SnmdwXnh8s/E---3.1_20804.p',m__1032) ).
fof(m__979,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& xp != sz00
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox/tmp/tmp.SnmdwXnh8s/E---3.1_20804.p',m__979) ).
fof(c_0_5,negated_conjecture,
~ ( ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xp,X1) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X48,X49] :
( ( ~ aInteger0(X49)
| sdtasdt0(xq,X49) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X48)
| sdtasdt0(xp,X48) != sdtpldt0(xa,smndt0(xb)) )
& ( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(X48)
| sdtasdt0(xp,X48) != sdtpldt0(xa,smndt0(xb)) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ aInteger0(X48)
| sdtasdt0(xp,X48) != sdtpldt0(xa,smndt0(xb)) )
& ( ~ aInteger0(X49)
| sdtasdt0(xq,X49) != sdtpldt0(xa,smndt0(xb))
| ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))) )
& ( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))) )
& ( ~ aInteger0(X49)
| sdtasdt0(xq,X49) != sdtpldt0(xa,smndt0(xb))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X2)
| sdtasdt0(xp,X2) != sdtpldt0(xa,smndt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[m__1071]) ).
fof(c_0_9,plain,
! [X8,X9] :
( ~ aInteger0(X8)
| ~ aInteger0(X9)
| aInteger0(sdtasdt0(X8,X9)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntMult])]) ).
cnf(c_0_10,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(sdtasdt0(xq,xm))
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__1032]) ).
cnf(c_0_13,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[m__979]) ).
cnf(c_0_14,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1) ),
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])]) ).
cnf(c_0_15,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[m__1071]) ).
cnf(c_0_16,hypothesis,
~ aInteger0(sdtasdt0(xp,xm)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[m__979]) ).
cnf(c_0_18,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_12]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM436+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 13:24:57 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.SnmdwXnh8s/E---3.1_20804.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20881 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.19/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.19/0.50 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.19/0.50 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with pid 20889 completed with status 0
% 0.19/0.50 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.19/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 27
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 57
% 0.19/0.50 # Removed in clause preprocessing : 1
% 0.19/0.50 # Initial clauses in saturation : 56
% 0.19/0.50 # Processed clauses : 112
% 0.19/0.50 # ...of these trivial : 1
% 0.19/0.50 # ...subsumed : 0
% 0.19/0.50 # ...remaining for further processing : 111
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 4
% 0.19/0.50 # Backward-rewritten : 0
% 0.19/0.50 # Generated clauses : 52
% 0.19/0.50 # ...of the previous two non-redundant : 30
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 51
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 1
% 0.19/0.50 # Total rewrite steps : 61
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 51
% 0.19/0.50 # Positive orientable unit clauses : 26
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 4
% 0.19/0.50 # Non-unit-clauses : 21
% 0.19/0.50 # Current number of unprocessed clauses: 30
% 0.19/0.50 # ...number of literals in the above : 98
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 60
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 262
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 143
% 0.19/0.50 # Non-unit clause-clause subsumptions : 4
% 0.19/0.50 # Unit Clause-clause subsumption calls : 34
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 4
% 0.19/0.50 # BW rewrite match successes : 0
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 4011
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.008 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.011 s
% 0.19/0.50 # Maximum resident set size: 1836 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.030 s
% 0.19/0.50 # System time : 0.008 s
% 0.19/0.50 # Total time : 0.039 s
% 0.19/0.50 # Maximum resident set size: 1708 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------