TSTP Solution File: NUM597+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---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 : n020.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:14:55 EDT 2024
% Result : Theorem 55.38s 7.50s
% Output : CNFRefutation 55.38s
% 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,
! [X94] :
( aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ( aElementOf0(X94,szDzozmdt0(xd))
| ~ aElementOf0(X94,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( sdtlpdtrp0(xd,X94) = szDzizrdt0(xd)
| ~ aElementOf0(X94,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( ~ aElementOf0(X94,szDzozmdt0(xd))
| sdtlpdtrp0(xd,X94) != szDzizrdt0(xd)
| aElementOf0(X94,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& aElementOf0(esk20_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,
! [X96,X97] :
( aFunction0(xd)
& szDzozmdt0(xd) = szNzAzT0
& ( aElementOf0(esk21_2(X96,X97),X97)
| sbrdtbr0(X97) != xk
| ~ aSet0(X97)
| sdtlpdtrp0(xd,X96) = sdtlpdtrp0(sdtlpdtrp0(xC,X96),X97)
| ~ aElementOf0(X96,szNzAzT0) )
& ( ~ aElementOf0(esk21_2(X96,X97),sdtlpdtrp0(xN,szszuzczcdt0(X96)))
| sbrdtbr0(X97) != xk
| ~ aSet0(X97)
| sdtlpdtrp0(xd,X96) = sdtlpdtrp0(sdtlpdtrp0(xC,X96),X97)
| ~ aElementOf0(X96,szNzAzT0) )
& ( ~ aSubsetOf0(X97,sdtlpdtrp0(xN,szszuzczcdt0(X96)))
| sbrdtbr0(X97) != xk
| ~ aSet0(X97)
| sdtlpdtrp0(xd,X96) = sdtlpdtrp0(sdtlpdtrp0(xC,X96),X97)
| ~ aElementOf0(X96,szNzAzT0) )
& ( ~ aElementOf0(X97,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X96)),xk))
| ~ aSet0(X97)
| sdtlpdtrp0(xd,X96) = sdtlpdtrp0(sdtlpdtrp0(xC,X96),X97)
| ~ aElementOf0(X96,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,
! [X88,X90,X91,X92] :
( aSet0(sdtlcdtrc0(xd,szDzozmdt0(xd)))
& ( aElementOf0(esk19_1(X88),szDzozmdt0(xd))
| ~ aElementOf0(X88,sdtlcdtrc0(xd,szDzozmdt0(xd))) )
& ( sdtlpdtrp0(xd,esk19_1(X88)) = X88
| ~ aElementOf0(X88,sdtlcdtrc0(xd,szDzozmdt0(xd))) )
& ( ~ aElementOf0(X91,szDzozmdt0(xd))
| sdtlpdtrp0(xd,X91) != X90
| aElementOf0(X90,sdtlcdtrc0(xd,szDzozmdt0(xd))) )
& ( ~ aElementOf0(X92,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| aElementOf0(X92,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(esk20_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(esk20_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,esk20_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,esk20_0),sdtlcdtrc0(xd,szNzAzT0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xd,esk20_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.09/0.09 % Problem : NUM597+3 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n020.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 06:23:22 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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/benchmark/theBenchmark.p
% 55.38/7.50 # Version: 3.1.0
% 55.38/7.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 55.38/7.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 55.38/7.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 55.38/7.50 # Starting new_bool_3 with 300s (1) cores
% 55.38/7.50 # Starting new_bool_1 with 300s (1) cores
% 55.38/7.50 # Starting sh5l with 300s (1) cores
% 55.38/7.50 # sh5l with pid 20117 completed with status 0
% 55.38/7.50 # Result found by sh5l
% 55.38/7.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 55.38/7.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 55.38/7.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 55.38/7.50 # Starting new_bool_3 with 300s (1) cores
% 55.38/7.50 # Starting new_bool_1 with 300s (1) cores
% 55.38/7.50 # Starting sh5l with 300s (1) cores
% 55.38/7.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 55.38/7.50 # Search class: FGHSF-SMLM32-MFFFFFNN
% 55.38/7.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 55.38/7.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 55.38/7.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 20118 completed with status 0
% 55.38/7.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 55.38/7.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 55.38/7.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 55.38/7.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 55.38/7.50 # Starting new_bool_3 with 300s (1) cores
% 55.38/7.50 # Starting new_bool_1 with 300s (1) cores
% 55.38/7.50 # Starting sh5l with 300s (1) cores
% 55.38/7.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 55.38/7.50 # Search class: FGHSF-SMLM32-MFFFFFNN
% 55.38/7.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 55.38/7.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 55.38/7.50 # Preprocessing time : 0.149 s
% 55.38/7.50 # Presaturation interreduction done
% 55.38/7.50
% 55.38/7.50 # Proof found!
% 55.38/7.50 # SZS status Theorem
% 55.38/7.50 # SZS output start CNFRefutation
% See solution above
% 55.38/7.50 # Parsed axioms : 95
% 55.38/7.50 # Removed by relevancy pruning/SinE : 3
% 55.38/7.50 # Initial clauses : 4842
% 55.38/7.50 # Removed in clause preprocessing : 7
% 55.38/7.50 # Initial clauses in saturation : 4835
% 55.38/7.50 # Processed clauses : 7527
% 55.38/7.50 # ...of these trivial : 12
% 55.38/7.50 # ...subsumed : 1082
% 55.38/7.50 # ...remaining for further processing : 6433
% 55.38/7.50 # Other redundant clauses eliminated : 2030
% 55.38/7.50 # Clauses deleted for lack of memory : 0
% 55.38/7.50 # Backward-subsumed : 20
% 55.38/7.50 # Backward-rewritten : 25
% 55.38/7.50 # Generated clauses : 4152
% 55.38/7.50 # ...of the previous two non-redundant : 4062
% 55.38/7.50 # ...aggressively subsumed : 0
% 55.38/7.50 # Contextual simplify-reflections : 80
% 55.38/7.50 # Paramodulations : 2319
% 55.38/7.50 # Factorizations : 0
% 55.38/7.50 # NegExts : 0
% 55.38/7.50 # Equation resolutions : 2033
% 55.38/7.50 # Disequality decompositions : 0
% 55.38/7.50 # Total rewrite steps : 992
% 55.38/7.50 # ...of those cached : 887
% 55.38/7.50 # Propositional unsat checks : 0
% 55.38/7.50 # Propositional check models : 0
% 55.38/7.50 # Propositional check unsatisfiable : 0
% 55.38/7.50 # Propositional clauses : 0
% 55.38/7.50 # Propositional clauses after purity: 0
% 55.38/7.50 # Propositional unsat core size : 0
% 55.38/7.50 # Propositional preprocessing time : 0.000
% 55.38/7.50 # Propositional encoding time : 0.000
% 55.38/7.50 # Propositional solver time : 0.000
% 55.38/7.50 # Success case prop preproc time : 0.000
% 55.38/7.50 # Success case prop encoding time : 0.000
% 55.38/7.50 # Success case prop solver time : 0.000
% 55.38/7.50 # Current number of processed clauses : 620
% 55.38/7.50 # Positive orientable unit clauses : 272
% 55.38/7.50 # Positive unorientable unit clauses: 0
% 55.38/7.50 # Negative unit clauses : 42
% 55.38/7.50 # Non-unit-clauses : 306
% 55.38/7.50 # Current number of unprocessed clauses: 5298
% 55.38/7.50 # ...number of literals in the above : 48072
% 55.38/7.50 # Current number of archived formulas : 0
% 55.38/7.50 # Current number of archived clauses : 3983
% 55.38/7.50 # Clause-clause subsumption calls (NU) : 10289982
% 55.38/7.50 # Rec. Clause-clause subsumption calls : 76294
% 55.38/7.50 # Non-unit clause-clause subsumptions : 1108
% 55.38/7.50 # Unit Clause-clause subsumption calls : 4418
% 55.38/7.50 # Rewrite failures with RHS unbound : 0
% 55.38/7.50 # BW rewrite match attempts : 112
% 55.38/7.50 # BW rewrite match successes : 8
% 55.38/7.50 # Condensation attempts : 0
% 55.38/7.50 # Condensation successes : 0
% 55.38/7.50 # Termbank termtop insertions : 692683
% 55.38/7.50 # Search garbage collected termcells : 31578
% 55.38/7.50
% 55.38/7.50 # -------------------------------------------------
% 55.38/7.50 # User time : 7.034 s
% 55.38/7.50 # System time : 0.040 s
% 55.38/7.50 # Total time : 7.074 s
% 55.38/7.50 # Maximum resident set size: 14140 pages
% 55.38/7.50
% 55.38/7.50 # -------------------------------------------------
% 55.38/7.50 # User time : 7.040 s
% 55.38/7.50 # System time : 0.042 s
% 55.38/7.50 # Total time : 7.082 s
% 55.38/7.50 # Maximum resident set size: 1884 pages
% 55.38/7.50 % E---3.1 exiting
% 55.38/7.50 % E exiting
%------------------------------------------------------------------------------