TSTP Solution File: NUM588+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM588+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:04 EDT 2024
% Result : Theorem 42.22s 5.94s
% Output : CNFRefutation 42.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 115 ( 11 equ)
% Maximal formula atoms : 44 ( 14 avg)
% Number of connectives : 134 ( 27 ~; 22 |; 61 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 10 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& X3 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
& aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(X2) )
=> ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xk
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X4] :
( aElementOf0(X4,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X4) ) )
=> ( ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X4] :
( aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X4)
& aElementOf0(X4,sdtlpdtrp0(xN,X1))
& X4 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) )
=> ( ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
| aSubsetOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
| aElementOf0(X3,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& X3 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
& aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(X2) )
=> ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xk
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X4] :
( aElementOf0(X4,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X4) ) )
=> ( ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X4] :
( aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X4)
& aElementOf0(X4,sdtlpdtrp0(xN,X1))
& X4 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) )
=> ( ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
| aSubsetOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
| aElementOf0(X3,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_2,negated_conjecture,
! [X231,X232,X233,X235,X236,X237] :
( aElementOf0(esk34_0,szNzAzT0)
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk34_0)),sdtlpdtrp0(xN,esk34_0))
& ( ~ aElementOf0(X231,sdtlpdtrp0(xN,esk34_0))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,esk34_0)),X231) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0))))
& ( aElement0(X232)
| ~ aElementOf0(X232,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))) )
& ( aElementOf0(X232,sdtlpdtrp0(xN,esk34_0))
| ~ aElementOf0(X232,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))) )
& ( X232 != szmzizndt0(sdtlpdtrp0(xN,esk34_0))
| ~ aElementOf0(X232,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))) )
& ( ~ aElement0(X232)
| ~ aElementOf0(X232,sdtlpdtrp0(xN,esk34_0))
| X232 = szmzizndt0(sdtlpdtrp0(xN,esk34_0))
| aElementOf0(X232,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))) )
& aSet0(esk35_0)
& ( ~ aElementOf0(X233,esk35_0)
| aElementOf0(X233,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))) )
& aSubsetOf0(esk35_0,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0))))
& isCountable0(esk35_0)
& aSet0(esk36_0)
& ( ~ aElementOf0(X235,esk36_0)
| aElementOf0(X235,esk35_0) )
& aSubsetOf0(esk36_0,esk35_0)
& sbrdtbr0(esk36_0) = xk
& aElementOf0(esk36_0,slbdtsldtrb0(esk35_0,xk))
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk34_0)),sdtlpdtrp0(xN,esk34_0))
& ( ~ aElementOf0(X236,sdtlpdtrp0(xN,esk34_0))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,esk34_0)),X236) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0))))
& ( aElement0(X237)
| ~ aElementOf0(X237,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))) )
& ( aElementOf0(X237,sdtlpdtrp0(xN,esk34_0))
| ~ aElementOf0(X237,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))) )
& ( X237 != szmzizndt0(sdtlpdtrp0(xN,esk34_0))
| ~ aElementOf0(X237,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))) )
& ( ~ aElement0(X237)
| ~ aElementOf0(X237,sdtlpdtrp0(xN,esk34_0))
| X237 = szmzizndt0(sdtlpdtrp0(xN,esk34_0))
| aElementOf0(X237,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))) )
& aElementOf0(esk37_0,esk36_0)
& ~ aElementOf0(esk37_0,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0))))
& ~ aSubsetOf0(esk36_0,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0))))
& ~ aElementOf0(esk36_0,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0))),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_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0))))
| ~ aElementOf0(X1,esk35_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( aElementOf0(X1,esk35_0)
| ~ aElementOf0(X1,esk36_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ aElementOf0(esk37_0,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
aElementOf0(esk37_0,esk36_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_3,c_0_4,c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM588+3 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n010.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon May 20 06:00:23 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 42.22/5.94 # Version: 3.1.0
% 42.22/5.94 # Preprocessing class: FSLSSMSMSSSNFFN.
% 42.22/5.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 42.22/5.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 42.22/5.94 # Starting new_bool_3 with 300s (1) cores
% 42.22/5.94 # Starting new_bool_1 with 300s (1) cores
% 42.22/5.94 # Starting sh5l with 300s (1) cores
% 42.22/5.94 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 26161 completed with status 0
% 42.22/5.94 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 42.22/5.94 # Preprocessing class: FSLSSMSMSSSNFFN.
% 42.22/5.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 42.22/5.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 42.22/5.94 # No SInE strategy applied
% 42.22/5.94 # Search class: FGHSF-SMLM32-MFFFFFNN
% 42.22/5.94 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 42.22/5.94 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 42.22/5.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 42.22/5.94 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 42.22/5.94 # Starting new_bool_3 with 136s (1) cores
% 42.22/5.94 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 42.22/5.94 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26170 completed with status 0
% 42.22/5.94 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 42.22/5.94 # Preprocessing class: FSLSSMSMSSSNFFN.
% 42.22/5.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 42.22/5.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 42.22/5.94 # No SInE strategy applied
% 42.22/5.94 # Search class: FGHSF-SMLM32-MFFFFFNN
% 42.22/5.94 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 42.22/5.94 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 42.22/5.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 42.22/5.94 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 42.22/5.94 # Starting new_bool_3 with 136s (1) cores
% 42.22/5.94 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 42.22/5.94 # Preprocessing time : 0.186 s
% 42.22/5.94 # SatCheck found unsatisfiable ground set
% 42.22/5.94 # Presaturation interreduction done
% 42.22/5.94
% 42.22/5.94 # Proof found!
% 42.22/5.94 # SZS status Theorem
% 42.22/5.94 # SZS output start CNFRefutation
% See solution above
% 42.22/5.94 # Parsed axioms : 88
% 42.22/5.94 # Removed by relevancy pruning/SinE : 0
% 42.22/5.94 # Initial clauses : 4438
% 42.22/5.94 # Removed in clause preprocessing : 7
% 42.22/5.94 # Initial clauses in saturation : 4431
% 42.22/5.94 # Processed clauses : 5606
% 42.22/5.94 # ...of these trivial : 2
% 42.22/5.94 # ...subsumed : 604
% 42.22/5.94 # ...remaining for further processing : 5000
% 42.22/5.94 # Other redundant clauses eliminated : 1634
% 42.22/5.94 # Clauses deleted for lack of memory : 0
% 42.22/5.94 # Backward-subsumed : 0
% 42.22/5.94 # Backward-rewritten : 1
% 42.22/5.94 # Generated clauses : 1505
% 42.22/5.94 # ...of the previous two non-redundant : 1506
% 42.22/5.94 # ...aggressively subsumed : 0
% 42.22/5.94 # Contextual simplify-reflections : 53
% 42.22/5.94 # Paramodulations : 0
% 42.22/5.94 # Factorizations : 0
% 42.22/5.94 # NegExts : 0
% 42.22/5.94 # Equation resolutions : 1634
% 42.22/5.94 # Disequality decompositions : 0
% 42.22/5.94 # Total rewrite steps : 15
% 42.22/5.94 # ...of those cached : 11
% 42.22/5.94 # Propositional unsat checks : 1
% 42.22/5.94 # Propositional check models : 0
% 42.22/5.94 # Propositional check unsatisfiable : 1
% 42.22/5.94 # Propositional clauses : 3825
% 42.22/5.94 # Propositional clauses after purity: 68
% 42.22/5.94 # Propositional unsat core size : 4
% 42.22/5.94 # Propositional preprocessing time : 0.000
% 42.22/5.94 # Propositional encoding time : 0.027
% 42.22/5.94 # Propositional solver time : 0.000
% 42.22/5.94 # Success case prop preproc time : 0.000
% 42.22/5.94 # Success case prop encoding time : 0.027
% 42.22/5.94 # Success case prop solver time : 0.000
% 42.22/5.94 # Current number of processed clauses : 3494
% 42.22/5.94 # Positive orientable unit clauses : 35
% 42.22/5.94 # Positive unorientable unit clauses: 0
% 42.22/5.94 # Negative unit clauses : 7
% 42.22/5.94 # Non-unit-clauses : 3452
% 42.22/5.94 # Current number of unprocessed clauses: 331
% 42.22/5.94 # ...number of literals in the above : 5094
% 42.22/5.94 # Current number of archived formulas : 0
% 42.22/5.94 # Current number of archived clauses : 1
% 42.22/5.94 # Clause-clause subsumption calls (NU) : 5595294
% 42.22/5.94 # Rec. Clause-clause subsumption calls : 71248
% 42.22/5.94 # Non-unit clause-clause subsumptions : 655
% 42.22/5.94 # Unit Clause-clause subsumption calls : 6
% 42.22/5.94 # Rewrite failures with RHS unbound : 0
% 42.22/5.94 # BW rewrite match attempts : 1
% 42.22/5.94 # BW rewrite match successes : 1
% 42.22/5.94 # Condensation attempts : 0
% 42.22/5.94 # Condensation successes : 0
% 42.22/5.94 # Termbank termtop insertions : 681105
% 42.22/5.94 # Search garbage collected termcells : 29143
% 42.22/5.94
% 42.22/5.94 # -------------------------------------------------
% 42.22/5.94 # User time : 5.252 s
% 42.22/5.94 # System time : 0.041 s
% 42.22/5.94 # Total time : 5.293 s
% 42.22/5.94 # Maximum resident set size: 13752 pages
% 42.22/5.94
% 42.22/5.94 # -------------------------------------------------
% 42.22/5.94 # User time : 25.653 s
% 42.22/5.94 # System time : 0.111 s
% 42.22/5.94 # Total time : 25.764 s
% 42.22/5.94 # Maximum resident set size: 1840 pages
% 42.22/5.94 % E---3.1 exiting
%------------------------------------------------------------------------------