TSTP Solution File: NUM584+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM584+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Tue May 21 01:27:03 EDT 2024
% Result : Theorem 1.67s 0.80s
% Output : CNFRefutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 107 ( 19 equ)
% Maximal formula atoms : 22 ( 9 avg)
% Number of connectives : 127 ( 31 ~; 37 |; 44 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) ) )
=> ( ( aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) ) )
=> ( ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
=> aElementOf0(X1,xS) )
| aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) )
& sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK )
| aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__4007,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) )
& sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4007) ).
fof(m__4024,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) )
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
=> aElementOf0(X1,xS) )
& aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4024) ).
fof(c_0_3,negated_conjecture,
~ ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) ) )
=> ( ( aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) ) )
=> ( ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
=> aElementOf0(X1,xS) )
| aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) )
& sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK )
| aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,negated_conjecture,
! [X229,X230] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X229,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X229) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElement0(X230)
| ~ aElementOf0(X230,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X230,xQ)
| X230 = szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X230,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElementOf0(X230,xQ)
| ~ aElement0(X230)
| aElementOf0(X230,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( X230 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElement0(X230)
| aElementOf0(X230,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(esk33_0,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK )
& ( ~ aElementOf0(esk33_0,xS)
| sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK )
& ( ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
| sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK )
& ~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
fof(c_0_5,hypothesis,
! [X224,X225] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X224,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X224) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElement0(X225)
| ~ aElementOf0(X225,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X225,xQ)
| X225 = szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X225,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElementOf0(X225,xQ)
| ~ aElement0(X225)
| aElementOf0(X225,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( X225 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElement0(X225)
| aElementOf0(X225,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4007])])])])]) ).
fof(c_0_6,hypothesis,
! [X226,X227,X228] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X226,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X226) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElement0(X227)
| ~ aElementOf0(X227,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X227,xQ)
| X227 = szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X227,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElementOf0(X227,xQ)
| ~ aElement0(X227)
| aElementOf0(X227,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( X227 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElement0(X227)
| aElementOf0(X227,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElementOf0(X228,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElementOf0(X228,xS) )
& aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4024])])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
| sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM584+3 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 03:41:53 EDT 2024
% 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/benchmark/theBenchmark.p
% 1.67/0.80 # Version: 3.1.0
% 1.67/0.80 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.67/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.67/0.80 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.67/0.80 # Starting new_bool_3 with 300s (1) cores
% 1.67/0.80 # Starting new_bool_1 with 300s (1) cores
% 1.67/0.80 # Starting sh5l with 300s (1) cores
% 1.67/0.80 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1149 completed with status 0
% 1.67/0.80 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.67/0.80 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.67/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.67/0.80 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.67/0.80 # No SInE strategy applied
% 1.67/0.80 # Search class: FGHSF-SMLM32-MFFFFFNN
% 1.67/0.80 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.67/0.80 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 1.67/0.80 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.67/0.80 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.67/0.80 # Starting new_bool_3 with 136s (1) cores
% 1.67/0.80 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.67/0.80 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 1156 completed with status 0
% 1.67/0.80 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 1.67/0.80 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.67/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.67/0.80 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.67/0.80 # No SInE strategy applied
% 1.67/0.80 # Search class: FGHSF-SMLM32-MFFFFFNN
% 1.67/0.80 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.67/0.80 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 1.67/0.80 # Preprocessing time : 0.091 s
% 1.67/0.80 # Presaturation interreduction done
% 1.67/0.80
% 1.67/0.80 # Proof found!
% 1.67/0.80 # SZS status Theorem
% 1.67/0.80 # SZS output start CNFRefutation
% See solution above
% 1.67/0.80 # Parsed axioms : 89
% 1.67/0.80 # Removed by relevancy pruning/SinE : 0
% 1.67/0.80 # Initial clauses : 4227
% 1.67/0.80 # Removed in clause preprocessing : 7
% 1.67/0.80 # Initial clauses in saturation : 4220
% 1.67/0.80 # Processed clauses : 38
% 1.67/0.80 # ...of these trivial : 5
% 1.67/0.80 # ...subsumed : 1
% 1.67/0.80 # ...remaining for further processing : 31
% 1.67/0.80 # Other redundant clauses eliminated : 2
% 1.67/0.80 # Clauses deleted for lack of memory : 0
% 1.67/0.80 # Backward-subsumed : 0
% 1.67/0.80 # Backward-rewritten : 1
% 1.67/0.80 # Generated clauses : 2
% 1.67/0.80 # ...of the previous two non-redundant : 3
% 1.67/0.80 # ...aggressively subsumed : 0
% 1.67/0.80 # Contextual simplify-reflections : 0
% 1.67/0.80 # Paramodulations : 0
% 1.67/0.80 # Factorizations : 0
% 1.67/0.80 # NegExts : 0
% 1.67/0.80 # Equation resolutions : 2
% 1.67/0.80 # Disequality decompositions : 0
% 1.67/0.80 # Total rewrite steps : 8
% 1.67/0.80 # ...of those cached : 4
% 1.67/0.80 # Propositional unsat checks : 0
% 1.67/0.80 # Propositional check models : 0
% 1.67/0.80 # Propositional check unsatisfiable : 0
% 1.67/0.80 # Propositional clauses : 0
% 1.67/0.80 # Propositional clauses after purity: 0
% 1.67/0.80 # Propositional unsat core size : 0
% 1.67/0.80 # Propositional preprocessing time : 0.000
% 1.67/0.80 # Propositional encoding time : 0.000
% 1.67/0.80 # Propositional solver time : 0.000
% 1.67/0.80 # Success case prop preproc time : 0.000
% 1.67/0.80 # Success case prop encoding time : 0.000
% 1.67/0.80 # Success case prop solver time : 0.000
% 1.67/0.80 # Current number of processed clauses : 28
% 1.67/0.80 # Positive orientable unit clauses : 20
% 1.67/0.80 # Positive unorientable unit clauses: 0
% 1.67/0.80 # Negative unit clauses : 4
% 1.67/0.80 # Non-unit-clauses : 4
% 1.67/0.80 # Current number of unprocessed clauses: 4185
% 1.67/0.80 # ...number of literals in the above : 51233
% 1.67/0.80 # Current number of archived formulas : 0
% 1.67/0.80 # Current number of archived clauses : 1
% 1.67/0.80 # Clause-clause subsumption calls (NU) : 2
% 1.67/0.80 # Rec. Clause-clause subsumption calls : 1
% 1.67/0.80 # Non-unit clause-clause subsumptions : 0
% 1.67/0.80 # Unit Clause-clause subsumption calls : 3
% 1.67/0.80 # Rewrite failures with RHS unbound : 0
% 1.67/0.80 # BW rewrite match attempts : 1
% 1.67/0.80 # BW rewrite match successes : 1
% 1.67/0.80 # Condensation attempts : 0
% 1.67/0.80 # Condensation successes : 0
% 1.67/0.80 # Termbank termtop insertions : 335146
% 1.67/0.80 # Search garbage collected termcells : 27267
% 1.67/0.80
% 1.67/0.80 # -------------------------------------------------
% 1.67/0.80 # User time : 0.281 s
% 1.67/0.80 # System time : 0.020 s
% 1.67/0.80 # Total time : 0.300 s
% 1.67/0.80 # Maximum resident set size: 13416 pages
% 1.67/0.80
% 1.67/0.80 # -------------------------------------------------
% 1.67/0.80 # User time : 0.642 s
% 1.67/0.80 # System time : 0.048 s
% 1.67/0.80 # Total time : 0.690 s
% 1.67/0.80 # Maximum resident set size: 1828 pages
% 1.67/0.80 % E---3.1 exiting
%------------------------------------------------------------------------------