TSTP Solution File: NUM578+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM578+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:48 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 47 ( 15 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 53 ( 21 ~; 15 |; 8 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn; 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& szmzizndt0(sdtlpdtrp0(xN,X2)) != szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) )
=> ( xi != xj
=> szmzizndt0(sdtlpdtrp0(xN,xi)) != szmzizndt0(sdtlpdtrp0(xN,xj)) ) ),
file('/export/starexec/sandbox/tmp/tmp.MujHDU0PmG/E---3.1_4060.p',m__) ).
fof(m__3856_02,hypothesis,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
file('/export/starexec/sandbox/tmp/tmp.MujHDU0PmG/E---3.1_4060.p',m__3856_02) ).
fof(m__3856,hypothesis,
( aElementOf0(xi,szNzAzT0)
& aElementOf0(xj,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/tmp.MujHDU0PmG/E---3.1_4060.p',m__3856) ).
fof(c_0_3,negated_conjecture,
~ ( ! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& szmzizndt0(sdtlpdtrp0(xN,X2)) != szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) )
=> ( xi != xj
=> szmzizndt0(sdtlpdtrp0(xN,xi)) != szmzizndt0(sdtlpdtrp0(xN,xj)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,hypothesis,
( xi = xj
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(fof_nnf,[status(thm)],[m__3856_02]) ).
fof(c_0_5,negated_conjecture,
! [X178,X179] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X179),sdtmndt0(sdtlpdtrp0(xN,X178),szmzizndt0(sdtlpdtrp0(xN,X178))))
| ~ sdtlseqdt0(szszuzczcdt0(X178),X179)
| ~ aElementOf0(X178,szNzAzT0)
| ~ aElementOf0(X179,szNzAzT0) )
& ( szmzizndt0(sdtlpdtrp0(xN,X179)) != szmzizndt0(sdtlpdtrp0(xN,X178))
| ~ sdtlseqdt0(szszuzczcdt0(X178),X179)
| ~ aElementOf0(X178,szNzAzT0)
| ~ aElementOf0(X179,szNzAzT0) )
& xi != xj
& szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,hypothesis,
( xi = xj
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
xi != xj,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X2))
| ~ sdtlseqdt0(szszuzczcdt0(X2),X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(sr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_13,hypothesis,
sdtlseqdt0(szszuzczcdt0(xi),xj),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_10]),c_0_12]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM578+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 13:56:05 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.MujHDU0PmG/E---3.1_4060.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4199 completed with status 0
% 0.20/0.52 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.20/0.52 # Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 151s (1) cores
% 0.20/0.52 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 146s (1) cores
% 0.20/0.52 # G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 4210 completed with status 0
% 0.20/0.52 # Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.20/0.52 # Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.20/0.52 # Preprocessing time : 0.004 s
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 86
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 175
% 0.20/0.52 # Removed in clause preprocessing : 7
% 0.20/0.52 # Initial clauses in saturation : 168
% 0.20/0.52 # Processed clauses : 74
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 4
% 0.20/0.52 # ...remaining for further processing : 70
% 0.20/0.52 # Other redundant clauses eliminated : 7
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 1
% 0.20/0.52 # Generated clauses : 42
% 0.20/0.52 # ...of the previous two non-redundant : 32
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 35
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 8
% 0.20/0.52 # Total rewrite steps : 39
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 64
% 0.20/0.52 # Positive orientable unit clauses : 28
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 7
% 0.20/0.52 # Non-unit-clauses : 29
% 0.20/0.52 # Current number of unprocessed clauses: 126
% 0.20/0.52 # ...number of literals in the above : 611
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 1
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 203
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 133
% 0.20/0.52 # Non-unit clause-clause subsumptions : 2
% 0.20/0.52 # Unit Clause-clause subsumption calls : 38
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 1
% 0.20/0.52 # BW rewrite match successes : 1
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 12095
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.015 s
% 0.20/0.52 # System time : 0.005 s
% 0.20/0.52 # Total time : 0.020 s
% 0.20/0.52 # Maximum resident set size: 2340 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.044 s
% 0.20/0.52 # System time : 0.017 s
% 0.20/0.52 # Total time : 0.061 s
% 0.20/0.52 # Maximum resident set size: 1788 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------