TSTP Solution File: NUM456+6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM456+6 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:55:50 EDT 2023
% Result : ContradictoryAxioms 0.38s 0.59s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 183 ( 33 equ)
% Maximal formula atoms : 44 ( 10 avg)
% Number of connectives : 218 ( 53 ~; 51 |; 98 &)
% ( 10 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn; 27 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/tmp.nYdzvckXI8/E---3.1_20587.p',m__2171) ).
fof(m__2079,hypothesis,
( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) )
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( X1 = sz10
| X1 = smndt0(sz10) ) )
& stldt0(sbsmnsldt0(xS)) = cS2076 ),
file('/export/starexec/sandbox2/tmp/tmp.nYdzvckXI8/E---3.1_20587.p',m__2079) ).
fof(m__2203,hypothesis,
? [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/sandbox2/tmp/tmp.nYdzvckXI8/E---3.1_20587.p',m__2203) ).
fof(c_0_3,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))) ),
inference(fof_simplification,[status(thm)],[m__2171]) ).
fof(c_0_4,hypothesis,
( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) )
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( X1 = sz10
| X1 = smndt0(sz10) ) )
& stldt0(sbsmnsldt0(xS)) = cS2076 ),
inference(fof_simplification,[status(thm)],[m__2079]) ).
fof(c_0_5,hypothesis,
! [X47,X49,X50,X51,X53,X54,X55,X56] :
( aInteger0(xp)
& xp != sz00
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ( aInteger0(X47)
| ~ aElementOf0(X47,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aInteger0(esk11_1(X47))
| ~ aElementOf0(X47,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( sdtasdt0(xp,esk11_1(X47)) = sdtpldt0(X47,smndt0(sz10))
| ~ aElementOf0(X47,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aDivisorOf0(xp,sdtpldt0(X47,smndt0(sz10)))
| ~ aElementOf0(X47,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( sdteqdtlpzmzozddtrp0(X47,sz10,xp)
| ~ aElementOf0(X47,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ aInteger0(X50)
| sdtasdt0(xp,X50) != sdtpldt0(X49,smndt0(sz10))
| ~ aInteger0(X49)
| aElementOf0(X49,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ aDivisorOf0(xp,sdtpldt0(X49,smndt0(sz10)))
| ~ aInteger0(X49)
| aElementOf0(X49,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ sdteqdtlpzmzozddtrp0(X49,sz10,xp)
| ~ aInteger0(X49)
| aElementOf0(X49,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& aSet0(sbsmnsldt0(xS))
& ( aInteger0(X51)
| ~ aElementOf0(X51,sbsmnsldt0(xS)) )
& ( aElementOf0(esk12_1(X51),xS)
| ~ aElementOf0(X51,sbsmnsldt0(xS)) )
& ( aElementOf0(X51,esk12_1(X51))
| ~ aElementOf0(X51,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X53)
| ~ aElementOf0(X54,xS)
| ~ aElementOf0(X53,X54)
| aElementOf0(X53,sbsmnsldt0(xS)) )
& ( aInteger0(X55)
| ~ aElementOf0(X55,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X55,sbsmnsldt0(xS))
| ~ aElementOf0(X55,stldt0(sbsmnsldt0(xS))) )
& ( ~ aInteger0(X55)
| aElementOf0(X55,sbsmnsldt0(xS))
| aElementOf0(X55,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X56,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| aElementOf0(X56,stldt0(sbsmnsldt0(xS))) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
inference(distribute,[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)],[c_0_3])])])])])]) ).
fof(c_0_6,hypothesis,
! [X17,X19,X20,X21,X22] :
( aSet0(sbsmnsldt0(xS))
& ( aInteger0(X17)
| ~ aElementOf0(X17,sbsmnsldt0(xS)) )
& ( aElementOf0(esk4_1(X17),xS)
| ~ aElementOf0(X17,sbsmnsldt0(xS)) )
& ( aElementOf0(X17,esk4_1(X17))
| ~ aElementOf0(X17,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X19)
| ~ aElementOf0(X20,xS)
| ~ aElementOf0(X19,X20)
| aElementOf0(X19,sbsmnsldt0(xS)) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ( aInteger0(X21)
| ~ aElementOf0(X21,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X21,sbsmnsldt0(xS))
| ~ aElementOf0(X21,stldt0(sbsmnsldt0(xS))) )
& ( ~ aInteger0(X21)
| aElementOf0(X21,sbsmnsldt0(xS))
| aElementOf0(X21,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X22,stldt0(sbsmnsldt0(xS)))
| X22 = sz10
| X22 = smndt0(sz10) )
& ( X22 != sz10
| aElementOf0(X22,stldt0(sbsmnsldt0(xS))) )
& ( X22 != smndt0(sz10)
| aElementOf0(X22,stldt0(sbsmnsldt0(xS))) )
& stldt0(sbsmnsldt0(xS)) = cS2076 ),
inference(distribute,[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)],[c_0_4])])])])])]) ).
cnf(c_0_7,hypothesis,
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
stldt0(sbsmnsldt0(xS)) = cS2076,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,hypothesis,
( aInteger0(esk13_0)
& aInteger0(esk14_0)
& sdtasdt0(xp,esk14_0) = sdtpldt0(esk13_0,smndt0(sz10))
& aDivisorOf0(xp,sdtpldt0(esk13_0,smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(esk13_0,sz10,xp)
& aElementOf0(esk13_0,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& esk13_0 != sz10
& esk13_0 != smndt0(sz10)
& ~ aElementOf0(esk13_0,cS2200) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2203])])]) ).
cnf(c_0_10,hypothesis,
( X1 = sz10
| X1 = smndt0(sz10)
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( aElementOf0(X1,cS2076)
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,hypothesis,
aElementOf0(esk13_0,szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
( X1 = smndt0(sz10)
| X1 = sz10
| ~ aElementOf0(X1,cS2076) ),
inference(rw,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_14,hypothesis,
aElementOf0(esk13_0,cS2076),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
esk13_0 != smndt0(sz10),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
esk13_0 != sz10,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM456+6 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 15:01:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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/tmp/tmp.nYdzvckXI8/E---3.1_20587.p
% 0.38/0.59 # Version: 3.1pre001
% 0.38/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.59 # Starting sh5l with 300s (1) cores
% 0.38/0.59 # sh5l with pid 20738 completed with status 8
% 0.38/0.59 # new_bool_3 with pid 20736 completed with status 0
% 0.38/0.59 # Result found by new_bool_3
% 0.38/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.59 # Search class: FGHSF-FSLM31-SFFFFFNN
% 0.38/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.59 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 148s (1) cores
% 0.38/0.59 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 20749 completed with status 0
% 0.38/0.59 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.59 # Search class: FGHSF-FSLM31-SFFFFFNN
% 0.38/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.59 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 148s (1) cores
% 0.38/0.59 # Preprocessing time : 0.006 s
% 0.38/0.59 # Presaturation interreduction done
% 0.38/0.59
% 0.38/0.59 # Proof found!
% 0.38/0.59 # SZS status ContradictoryAxioms
% 0.38/0.59 # SZS output start CNFRefutation
% See solution above
% 0.38/0.59 # Parsed axioms : 48
% 0.38/0.59 # Removed by relevancy pruning/SinE : 4
% 0.38/0.59 # Initial clauses : 206
% 0.38/0.59 # Removed in clause preprocessing : 6
% 0.38/0.59 # Initial clauses in saturation : 200
% 0.38/0.59 # Processed clauses : 323
% 0.38/0.59 # ...of these trivial : 3
% 0.38/0.59 # ...subsumed : 19
% 0.38/0.59 # ...remaining for further processing : 301
% 0.38/0.59 # Other redundant clauses eliminated : 25
% 0.38/0.59 # Clauses deleted for lack of memory : 0
% 0.38/0.59 # Backward-subsumed : 0
% 0.38/0.59 # Backward-rewritten : 1
% 0.38/0.59 # Generated clauses : 82
% 0.38/0.59 # ...of the previous two non-redundant : 60
% 0.38/0.59 # ...aggressively subsumed : 0
% 0.38/0.59 # Contextual simplify-reflections : 1
% 0.38/0.59 # Paramodulations : 57
% 0.38/0.59 # Factorizations : 0
% 0.38/0.59 # NegExts : 0
% 0.38/0.59 # Equation resolutions : 25
% 0.38/0.59 # Total rewrite steps : 94
% 0.38/0.59 # Propositional unsat checks : 0
% 0.38/0.59 # Propositional check models : 0
% 0.38/0.59 # Propositional check unsatisfiable : 0
% 0.38/0.59 # Propositional clauses : 0
% 0.38/0.59 # Propositional clauses after purity: 0
% 0.38/0.59 # Propositional unsat core size : 0
% 0.38/0.59 # Propositional preprocessing time : 0.000
% 0.38/0.59 # Propositional encoding time : 0.000
% 0.38/0.59 # Propositional solver time : 0.000
% 0.38/0.59 # Success case prop preproc time : 0.000
% 0.38/0.59 # Success case prop encoding time : 0.000
% 0.38/0.59 # Success case prop solver time : 0.000
% 0.38/0.59 # Current number of processed clauses : 93
% 0.38/0.59 # Positive orientable unit clauses : 25
% 0.38/0.59 # Positive unorientable unit clauses: 0
% 0.38/0.59 # Negative unit clauses : 5
% 0.38/0.59 # Non-unit-clauses : 63
% 0.38/0.59 # Current number of unprocessed clauses: 118
% 0.38/0.59 # ...number of literals in the above : 519
% 0.38/0.59 # Current number of archived formulas : 0
% 0.38/0.59 # Current number of archived clauses : 183
% 0.38/0.59 # Clause-clause subsumption calls (NU) : 6835
% 0.38/0.59 # Rec. Clause-clause subsumption calls : 1606
% 0.38/0.59 # Non-unit clause-clause subsumptions : 20
% 0.38/0.59 # Unit Clause-clause subsumption calls : 16
% 0.38/0.59 # Rewrite failures with RHS unbound : 0
% 0.38/0.59 # BW rewrite match attempts : 1
% 0.38/0.59 # BW rewrite match successes : 1
% 0.38/0.59 # Condensation attempts : 0
% 0.38/0.59 # Condensation successes : 0
% 0.38/0.59 # Termbank termtop insertions : 15728
% 0.38/0.59
% 0.38/0.59 # -------------------------------------------------
% 0.38/0.59 # User time : 0.049 s
% 0.38/0.59 # System time : 0.007 s
% 0.38/0.59 # Total time : 0.056 s
% 0.38/0.59 # Maximum resident set size: 2340 pages
% 0.38/0.59
% 0.38/0.59 # -------------------------------------------------
% 0.38/0.59 # User time : 0.073 s
% 0.38/0.59 # System time : 0.021 s
% 0.38/0.59 # Total time : 0.094 s
% 0.38/0.59 # Maximum resident set size: 1752 pages
% 0.38/0.59 % E---3.1 exiting
% 0.38/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------