TSTP Solution File: NUM597+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM597+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:08 EDT 2024
% Result : Theorem 44.24s 6.16s
% Output : CNFRefutation 44.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 89 ( 21 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 102 ( 37 ~; 34 |; 24 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__4868,hypothesis,
~ ( ( aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
<=> ( aElementOf0(X1,szDzozmdt0(xd))
& sdtlpdtrp0(xd,X1) = szDzizrdt0(xd) ) ) )
=> ~ ? [X1] : aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4868) ).
fof(m__4730,hypothesis,
( aFunction0(xd)
& szDzozmdt0(xd) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aSet0(X2)
& ( ( ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtlpdtrp0(xN,szszuzczcdt0(X1))) )
| aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1))) )
& sbrdtbr0(X2) = xk )
| aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk)) ) )
=> sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4730) ).
fof(m__4758,hypothesis,
( aSet0(sdtlcdtrc0(xd,szDzozmdt0(xd)))
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xd,szDzozmdt0(xd)))
<=> ? [X2] :
( aElementOf0(X2,szDzozmdt0(xd))
& sdtlpdtrp0(xd,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xd,szDzozmdt0(xd)))
=> aElementOf0(X1,xT) )
& aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4758) ).
fof(m__,conjecture,
aElementOf0(szDzizrdt0(xd),xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(c_0_4,hypothesis,
! [X75] :
( aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ( aElementOf0(X75,szDzozmdt0(xd))
| ~ aElementOf0(X75,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( sdtlpdtrp0(xd,X75) = szDzizrdt0(xd)
| ~ aElementOf0(X75,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( ~ aElementOf0(X75,szDzozmdt0(xd))
| sdtlpdtrp0(xd,X75) != szDzizrdt0(xd)
| aElementOf0(X75,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& aElementOf0(esk19_0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
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)],[m__4868])])])])])]) ).
fof(c_0_5,hypothesis,
! [X67,X68] :
( aFunction0(xd)
& szDzozmdt0(xd) = szNzAzT0
& ( aElementOf0(esk17_2(X67,X68),X68)
| sbrdtbr0(X68) != xk
| ~ aSet0(X68)
| sdtlpdtrp0(xd,X67) = sdtlpdtrp0(sdtlpdtrp0(xC,X67),X68)
| ~ aElementOf0(X67,szNzAzT0) )
& ( ~ aElementOf0(esk17_2(X67,X68),sdtlpdtrp0(xN,szszuzczcdt0(X67)))
| sbrdtbr0(X68) != xk
| ~ aSet0(X68)
| sdtlpdtrp0(xd,X67) = sdtlpdtrp0(sdtlpdtrp0(xC,X67),X68)
| ~ aElementOf0(X67,szNzAzT0) )
& ( ~ aSubsetOf0(X68,sdtlpdtrp0(xN,szszuzczcdt0(X67)))
| sbrdtbr0(X68) != xk
| ~ aSet0(X68)
| sdtlpdtrp0(xd,X67) = sdtlpdtrp0(sdtlpdtrp0(xC,X67),X68)
| ~ aElementOf0(X67,szNzAzT0) )
& ( ~ aElementOf0(X68,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X67)),xk))
| ~ aSet0(X68)
| sdtlpdtrp0(xd,X67) = sdtlpdtrp0(sdtlpdtrp0(xC,X67),X68)
| ~ aElementOf0(X67,szNzAzT0) ) ),
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)],[m__4730])])])])])]) ).
fof(c_0_6,hypothesis,
! [X70,X72,X73,X74] :
( aSet0(sdtlcdtrc0(xd,szDzozmdt0(xd)))
& ( aElementOf0(esk18_1(X70),szDzozmdt0(xd))
| ~ aElementOf0(X70,sdtlcdtrc0(xd,szDzozmdt0(xd))) )
& ( sdtlpdtrp0(xd,esk18_1(X70)) = X70
| ~ aElementOf0(X70,sdtlcdtrc0(xd,szDzozmdt0(xd))) )
& ( ~ aElementOf0(X73,szDzozmdt0(xd))
| sdtlpdtrp0(xd,X73) != X72
| aElementOf0(X72,sdtlcdtrc0(xd,szDzozmdt0(xd))) )
& ( ~ aElementOf0(X74,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| aElementOf0(X74,xT) )
& aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[m__4758])])])])])])]) ).
cnf(c_0_7,hypothesis,
( aElementOf0(X1,szDzozmdt0(xd))
| ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_10,hypothesis,
( aElementOf0(X2,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| ~ aElementOf0(X1,szDzozmdt0(xd))
| sdtlpdtrp0(xd,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,hypothesis,
aElementOf0(esk19_0,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_13,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
( sdtlpdtrp0(xd,X1) = szDzizrdt0(xd)
| ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xd,szDzozmdt0(xd))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,hypothesis,
( aElementOf0(sdtlpdtrp0(xd,X1),sdtlcdtrc0(xd,szNzAzT0))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8]),c_0_8])]) ).
cnf(c_0_17,hypothesis,
aElementOf0(esk19_0,szNzAzT0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
szDzizrdt0(xd) = sdtlpdtrp0(xd,esk19_0),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_20,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xd,szNzAzT0)) ),
inference(rw,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_21,hypothesis,
aElementOf0(sdtlpdtrp0(xd,esk19_0),sdtlcdtrc0(xd,szNzAzT0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xd,esk19_0),xT),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM597+3 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n028.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 06:23:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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
% 44.24/6.16 # Version: 3.1.0
% 44.24/6.16 # Preprocessing class: FSLSSMSMSSSNFFN.
% 44.24/6.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.24/6.16 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 44.24/6.16 # Starting new_bool_3 with 300s (1) cores
% 44.24/6.16 # Starting new_bool_1 with 300s (1) cores
% 44.24/6.16 # Starting sh5l with 300s (1) cores
% 44.24/6.16 # new_bool_3 with pid 10044 completed with status 0
% 44.24/6.16 # Result found by new_bool_3
% 44.24/6.16 # Preprocessing class: FSLSSMSMSSSNFFN.
% 44.24/6.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.24/6.16 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 44.24/6.16 # Starting new_bool_3 with 300s (1) cores
% 44.24/6.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 44.24/6.16 # Search class: FGHSF-SMLM32-MFFFFFNN
% 44.24/6.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 44.24/6.16 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 181s (1) cores
% 44.24/6.16 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 10048 completed with status 0
% 44.24/6.16 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 44.24/6.16 # Preprocessing class: FSLSSMSMSSSNFFN.
% 44.24/6.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.24/6.16 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 44.24/6.16 # Starting new_bool_3 with 300s (1) cores
% 44.24/6.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 44.24/6.16 # Search class: FGHSF-SMLM32-MFFFFFNN
% 44.24/6.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 44.24/6.16 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 181s (1) cores
% 44.24/6.16 # Preprocessing time : 0.103 s
% 44.24/6.16 # Presaturation interreduction done
% 44.24/6.16
% 44.24/6.16 # Proof found!
% 44.24/6.16 # SZS status Theorem
% 44.24/6.16 # SZS output start CNFRefutation
% See solution above
% 44.24/6.16 # Parsed axioms : 95
% 44.24/6.16 # Removed by relevancy pruning/SinE : 2
% 44.24/6.16 # Initial clauses : 4847
% 44.24/6.16 # Removed in clause preprocessing : 7
% 44.24/6.16 # Initial clauses in saturation : 4840
% 44.24/6.16 # Processed clauses : 7506
% 44.24/6.16 # ...of these trivial : 15
% 44.24/6.16 # ...subsumed : 1067
% 44.24/6.16 # ...remaining for further processing : 6424
% 44.24/6.16 # Other redundant clauses eliminated : 2030
% 44.24/6.16 # Clauses deleted for lack of memory : 0
% 44.24/6.16 # Backward-subsumed : 18
% 44.24/6.16 # Backward-rewritten : 28
% 44.24/6.16 # Generated clauses : 4087
% 44.24/6.16 # ...of the previous two non-redundant : 4005
% 44.24/6.16 # ...aggressively subsumed : 0
% 44.24/6.16 # Contextual simplify-reflections : 80
% 44.24/6.16 # Paramodulations : 2254
% 44.24/6.16 # Factorizations : 0
% 44.24/6.16 # NegExts : 0
% 44.24/6.16 # Equation resolutions : 2033
% 44.24/6.16 # Disequality decompositions : 0
% 44.24/6.16 # Total rewrite steps : 1013
% 44.24/6.16 # ...of those cached : 907
% 44.24/6.16 # Propositional unsat checks : 0
% 44.24/6.16 # Propositional check models : 0
% 44.24/6.16 # Propositional check unsatisfiable : 0
% 44.24/6.16 # Propositional clauses : 0
% 44.24/6.16 # Propositional clauses after purity: 0
% 44.24/6.16 # Propositional unsat core size : 0
% 44.24/6.16 # Propositional preprocessing time : 0.000
% 44.24/6.16 # Propositional encoding time : 0.000
% 44.24/6.16 # Propositional solver time : 0.000
% 44.24/6.16 # Success case prop preproc time : 0.000
% 44.24/6.16 # Success case prop encoding time : 0.000
% 44.24/6.16 # Success case prop solver time : 0.000
% 44.24/6.16 # Current number of processed clauses : 605
% 44.24/6.16 # Positive orientable unit clauses : 275
% 44.24/6.16 # Positive unorientable unit clauses: 0
% 44.24/6.16 # Negative unit clauses : 38
% 44.24/6.16 # Non-unit-clauses : 292
% 44.24/6.16 # Current number of unprocessed clauses: 5274
% 44.24/6.16 # ...number of literals in the above : 47858
% 44.24/6.16 # Current number of archived formulas : 0
% 44.24/6.16 # Current number of archived clauses : 3989
% 44.24/6.16 # Clause-clause subsumption calls (NU) : 10742384
% 44.24/6.16 # Rec. Clause-clause subsumption calls : 76552
% 44.24/6.16 # Non-unit clause-clause subsumptions : 1101
% 44.24/6.16 # Unit Clause-clause subsumption calls : 6649
% 44.24/6.16 # Rewrite failures with RHS unbound : 0
% 44.24/6.16 # BW rewrite match attempts : 93
% 44.24/6.16 # BW rewrite match successes : 12
% 44.24/6.16 # Condensation attempts : 0
% 44.24/6.16 # Condensation successes : 0
% 44.24/6.16 # Termbank termtop insertions : 692126
% 44.24/6.16 # Search garbage collected termcells : 31479
% 44.24/6.16
% 44.24/6.16 # -------------------------------------------------
% 44.24/6.16 # User time : 5.458 s
% 44.24/6.16 # System time : 0.041 s
% 44.24/6.16 # Total time : 5.499 s
% 44.24/6.16 # Maximum resident set size: 14148 pages
% 44.24/6.16
% 44.24/6.16 # -------------------------------------------------
% 44.24/6.16 # User time : 5.463 s
% 44.24/6.16 # System time : 0.045 s
% 44.24/6.16 # Total time : 5.508 s
% 44.24/6.16 # Maximum resident set size: 1884 pages
% 44.24/6.16 % E---3.1 exiting
%------------------------------------------------------------------------------