TSTP Solution File: NUM550+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM550+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:38 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 58 ( 27 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 62 ( 24 ~; 13 |; 21 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 9 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
~ ( ~ ? [X1] : aElementOf0(X1,xQ)
& xQ = slcrc0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(m__2270,hypothesis,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2270) ).
fof(m__2202_02,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202_02) ).
fof(c_0_5,negated_conjecture,
~ ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
& xQ = slcrc0 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X26] :
( ( sbrdtbr0(X26) != sz00
| X26 = slcrc0
| ~ aSet0(X26) )
& ( X26 != slcrc0
| sbrdtbr0(X26) = sz00
| ~ aSet0(X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])])]) ).
fof(c_0_7,plain,
! [X30,X31,X32] :
( ( aSet0(X30)
| X30 != slcrc0 )
& ( ~ aElementOf0(X31,X30)
| X30 != slcrc0 )
& ( ~ aSet0(X32)
| aElementOf0(esk6_1(X32),X32)
| X32 = slcrc0 ) ),
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)],[mDefEmp])])])])])])]) ).
fof(c_0_8,hypothesis,
! [X19] :
( aSet0(xQ)
& ( ~ aElementOf0(X19,xQ)
| aElementOf0(X19,xS) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2270])])])]) ).
fof(c_0_9,negated_conjecture,
! [X20] :
( ~ aElementOf0(X20,xQ)
& xQ = slcrc0 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_10,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
inference(fof_simplification,[status(thm)],[m__2202_02]) ).
cnf(c_0_11,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
xQ = slcrc0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0 ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,hypothesis,
sbrdtbr0(slcrc0) = xk,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
xk != sz00,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM550+3 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 05:46:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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
% 0.19/0.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_1 with pid 30933 completed with status 0
% 0.19/0.50 # Result found by new_bool_1
% 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 0.19/0.50 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 30936 completed with status 0
% 0.19/0.50 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 0.19/0.50 # Preprocessing time : 0.003 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 67
% 0.19/0.50 # Removed by relevancy pruning/SinE : 5
% 0.19/0.50 # Initial clauses : 141
% 0.19/0.50 # Removed in clause preprocessing : 5
% 0.19/0.50 # Initial clauses in saturation : 136
% 0.19/0.50 # Processed clauses : 165
% 0.19/0.50 # ...of these trivial : 3
% 0.19/0.50 # ...subsumed : 5
% 0.19/0.50 # ...remaining for further processing : 157
% 0.19/0.50 # Other redundant clauses eliminated : 3
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 1
% 0.19/0.50 # Backward-rewritten : 1
% 0.19/0.50 # Generated clauses : 11
% 0.19/0.50 # ...of the previous two non-redundant : 10
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 11
% 0.19/0.50 # Paramodulations : 3
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 8
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 16
% 0.19/0.50 # ...of those cached : 11
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 25
% 0.19/0.50 # Positive orientable unit clauses : 13
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 3
% 0.19/0.50 # Non-unit-clauses : 9
% 0.19/0.50 # Current number of unprocessed clauses: 108
% 0.19/0.50 # ...number of literals in the above : 401
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 129
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 3172
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 629
% 0.19/0.50 # Non-unit clause-clause subsumptions : 16
% 0.19/0.50 # Unit Clause-clause subsumption calls : 77
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 1
% 0.19/0.50 # BW rewrite match successes : 1
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 11585
% 0.19/0.50 # Search garbage collected termcells : 2497
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.021 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.024 s
% 0.19/0.50 # Maximum resident set size: 2204 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.025 s
% 0.19/0.50 # System time : 0.004 s
% 0.19/0.50 # Total time : 0.029 s
% 0.19/0.50 # Maximum resident set size: 1776 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------