TSTP Solution File: NUM549+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM549+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:56:18 EDT 2023
% Result : Theorem 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 63 ( 22 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 65 ( 27 ~; 23 |; 10 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn; 11 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
file('/export/starexec/sandbox/tmp/tmp.GxqXTluKJ0/E---3.1_362.p',m__) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.GxqXTluKJ0/E---3.1_362.p',mEOfElem) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.GxqXTluKJ0/E---3.1_362.p',mDefEmp) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox/tmp/tmp.GxqXTluKJ0/E---3.1_362.p',mCardEmpty) ).
fof(m__2291,hypothesis,
( aSet0(xQ)
& isFinite0(xQ)
& sbrdtbr0(xQ) = xk ),
file('/export/starexec/sandbox/tmp/tmp.GxqXTluKJ0/E---3.1_362.p',m__2291) ).
fof(m__2202_02,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
file('/export/starexec/sandbox/tmp/tmp.GxqXTluKJ0/E---3.1_362.p',m__2202_02) ).
fof(c_0_6,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,plain,
! [X6,X7] :
( ~ aSet0(X6)
| ~ aElementOf0(X7,X6)
| aElement0(X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
fof(c_0_8,plain,
! [X8,X9,X10] :
( ( aSet0(X8)
| X8 != slcrc0 )
& ( ~ aElementOf0(X9,X8)
| X8 != slcrc0 )
& ( ~ aSet0(X10)
| aElementOf0(esk1_1(X10),X10)
| X10 = slcrc0 ) ),
inference(distribute,[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_9,negated_conjecture,
! [X5] :
( ~ aElement0(X5)
| ~ aElementOf0(X5,xQ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
cnf(c_0_10,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( aElementOf0(esk1_1(X1),X1)
| X1 = slcrc0
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ aElement0(X1)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( X1 = slcrc0
| aElement0(esk1_1(X1))
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,plain,
! [X77] :
( ( sbrdtbr0(X77) != sz00
| X77 = slcrc0
| ~ aSet0(X77) )
& ( X77 != slcrc0
| sbrdtbr0(X77) = sz00
| ~ aSet0(X77) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])]) ).
cnf(c_0_15,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( X1 = slcrc0
| ~ aElementOf0(esk1_1(X1),xQ)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[m__2291]) ).
cnf(c_0_18,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,hypothesis,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[m__2291]) ).
cnf(c_0_21,negated_conjecture,
xQ = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_17])]) ).
cnf(c_0_22,plain,
sbrdtbr0(slcrc0) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_19])]) ).
cnf(c_0_23,hypothesis,
xk != sz00,
inference(split_conjunct,[status(thm)],[m__2202_02]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM549+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 14:35:06 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.GxqXTluKJ0/E---3.1_362.p
% 0.18/0.49 # Version: 3.1pre001
% 0.18/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # sh5l with pid 444 completed with status 0
% 0.18/0.49 # Result found by sh5l
% 0.18/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.49 # Search class: FGHSF-FSMM31-MFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.49 # SAT001_MinMin_p005000_rr_RG with pid 453 completed with status 0
% 0.18/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.49 # Search class: FGHSF-FSMM31-MFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.49 # Preprocessing time : 0.002 s
% 0.18/0.49 # Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Theorem
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 67
% 0.18/0.49 # Removed by relevancy pruning/SinE : 3
% 0.18/0.49 # Initial clauses : 116
% 0.18/0.49 # Removed in clause preprocessing : 5
% 0.18/0.49 # Initial clauses in saturation : 111
% 0.18/0.49 # Processed clauses : 205
% 0.18/0.49 # ...of these trivial : 0
% 0.18/0.49 # ...subsumed : 5
% 0.18/0.49 # ...remaining for further processing : 200
% 0.18/0.49 # Other redundant clauses eliminated : 29
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 0
% 0.18/0.49 # Backward-rewritten : 14
% 0.18/0.49 # Generated clauses : 71
% 0.18/0.49 # ...of the previous two non-redundant : 68
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 13
% 0.18/0.49 # Paramodulations : 45
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 29
% 0.18/0.49 # Total rewrite steps : 47
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 50
% 0.18/0.49 # Positive orientable unit clauses : 16
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 5
% 0.18/0.49 # Non-unit-clauses : 29
% 0.18/0.49 # Current number of unprocessed clauses: 75
% 0.18/0.49 # ...number of literals in the above : 327
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 125
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 2847
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 587
% 0.18/0.49 # Non-unit clause-clause subsumptions : 14
% 0.18/0.49 # Unit Clause-clause subsumption calls : 47
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 1
% 0.18/0.49 # BW rewrite match successes : 1
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 9308
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.016 s
% 0.18/0.49 # System time : 0.003 s
% 0.18/0.49 # Total time : 0.020 s
% 0.18/0.49 # Maximum resident set size: 2080 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.019 s
% 0.18/0.49 # System time : 0.005 s
% 0.18/0.49 # Total time : 0.024 s
% 0.18/0.49 # Maximum resident set size: 1752 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------