TSTP Solution File: NUM552+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM552+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:19 EDT 2023
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 10 unt; 0 def)
% Number of atoms : 116 ( 17 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 151 ( 63 ~; 63 |; 17 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-3 aty)
% Number of variables : 36 ( 0 sgn; 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CAcVghcQTh/E---3.1_7618.p',mDefSub) ).
fof(mDefSel,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElementOf0(X2,szNzAzT0) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aSubsetOf0(X4,X1)
& sbrdtbr0(X4) = X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CAcVghcQTh/E---3.1_7618.p',mDefSel) ).
fof(m__2227,hypothesis,
( aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& slbdtsldtrb0(xS,xk) != slcrc0 ),
file('/export/starexec/sandbox/tmp/tmp.CAcVghcQTh/E---3.1_7618.p',m__2227) ).
fof(m__2202,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmp.CAcVghcQTh/E---3.1_7618.p',m__2202) ).
fof(m__2202_02,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
file('/export/starexec/sandbox/tmp/tmp.CAcVghcQTh/E---3.1_7618.p',m__2202_02) ).
fof(m__,conjecture,
( aElementOf0(xx,xQ)
=> aElementOf0(xx,xT) ),
file('/export/starexec/sandbox/tmp/tmp.CAcVghcQTh/E---3.1_7618.p',m__) ).
fof(m__2270,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox/tmp/tmp.CAcVghcQTh/E---3.1_7618.p',m__2270) ).
fof(c_0_7,plain,
! [X13,X14,X15,X16] :
( ( aSet0(X14)
| ~ aSubsetOf0(X14,X13)
| ~ aSet0(X13) )
& ( ~ aElementOf0(X15,X14)
| aElementOf0(X15,X13)
| ~ aSubsetOf0(X14,X13)
| ~ aSet0(X13) )
& ( aElementOf0(esk2_2(X13,X16),X16)
| ~ aSet0(X16)
| aSubsetOf0(X16,X13)
| ~ aSet0(X13) )
& ( ~ aElementOf0(esk2_2(X13,X16),X13)
| ~ aSet0(X16)
| aSubsetOf0(X16,X13)
| ~ aSet0(X13) ) ),
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)],[mDefSub])])])])])]) ).
fof(c_0_8,plain,
! [X110,X111,X112,X113,X114,X115] :
( ( aSet0(X112)
| X112 != slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( aSubsetOf0(X113,X110)
| ~ aElementOf0(X113,X112)
| X112 != slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( sbrdtbr0(X113) = X111
| ~ aElementOf0(X113,X112)
| X112 != slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( ~ aSubsetOf0(X114,X110)
| sbrdtbr0(X114) != X111
| aElementOf0(X114,X112)
| X112 != slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( ~ aElementOf0(esk11_3(X110,X111,X115),X115)
| ~ aSubsetOf0(esk11_3(X110,X111,X115),X110)
| sbrdtbr0(esk11_3(X110,X111,X115)) != X111
| ~ aSet0(X115)
| X115 = slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( aSubsetOf0(esk11_3(X110,X111,X115),X110)
| aElementOf0(esk11_3(X110,X111,X115),X115)
| ~ aSet0(X115)
| X115 = slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( sbrdtbr0(esk11_3(X110,X111,X115)) = X111
| aElementOf0(esk11_3(X110,X111,X115),X115)
| ~ aSet0(X115)
| X115 = slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) ) ),
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)],[mDefSel])])])])])]) ).
cnf(c_0_9,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)),
inference(split_conjunct,[status(thm)],[m__2227]) ).
cnf(c_0_11,plain,
( aSet0(X1)
| X1 != slbdtsldtrb0(X2,X3)
| ~ aSet0(X2)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X1,X3)
| X3 != slbdtsldtrb0(X2,X4)
| ~ aSet0(X2)
| ~ aElementOf0(X4,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
( aElementOf0(X1,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
| ~ aSet0(slbdtsldtrb0(xT,xk)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( aSet0(slbdtsldtrb0(X1,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__2202]) ).
cnf(c_0_16,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__2202_02]) ).
cnf(c_0_17,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
( aElementOf0(X1,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X1,slbdtsldtrb0(xS,xk)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
fof(c_0_19,negated_conjecture,
~ ( aElementOf0(xx,xQ)
=> aElementOf0(xx,xT) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_20,hypothesis,
( aSubsetOf0(X1,xT)
| ~ aElementOf0(X1,slbdtsldtrb0(xS,xk)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]),c_0_16])]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[m__2270]) ).
fof(c_0_22,negated_conjecture,
( aElementOf0(xx,xQ)
& ~ aElementOf0(xx,xT) ),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
cnf(c_0_23,hypothesis,
aSubsetOf0(xQ,xT),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_23]),c_0_16])]) ).
cnf(c_0_26,negated_conjecture,
aElementOf0(xx,xQ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM552+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n022.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:38:54 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 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.CAcVghcQTh/E---3.1_7618.p
% 0.19/0.48 # Version: 3.1pre001
% 0.19/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7696 completed with status 0
% 0.19/0.48 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGHSF-FSMM31-MFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.48 # Starting sh5l with 136s (1) cores
% 0.19/0.48 # SAT001_MinMin_p005000_rr_RG with pid 7700 completed with status 0
% 0.19/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGHSF-FSMM31-MFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.48 # Preprocessing time : 0.002 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 68
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 125
% 0.19/0.48 # Removed in clause preprocessing : 6
% 0.19/0.48 # Initial clauses in saturation : 119
% 0.19/0.48 # Processed clauses : 280
% 0.19/0.48 # ...of these trivial : 1
% 0.19/0.48 # ...subsumed : 16
% 0.19/0.48 # ...remaining for further processing : 263
% 0.19/0.48 # Other redundant clauses eliminated : 33
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 1
% 0.19/0.48 # Backward-rewritten : 3
% 0.19/0.48 # Generated clauses : 184
% 0.19/0.48 # ...of the previous two non-redundant : 149
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 18
% 0.19/0.48 # Paramodulations : 153
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 34
% 0.19/0.48 # Total rewrite steps : 91
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 113
% 0.19/0.48 # Positive orientable unit clauses : 26
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 6
% 0.19/0.48 # Non-unit-clauses : 81
% 0.19/0.48 # Current number of unprocessed clauses: 106
% 0.19/0.48 # ...number of literals in the above : 519
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 123
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 3470
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 891
% 0.19/0.48 # Non-unit clause-clause subsumptions : 31
% 0.19/0.48 # Unit Clause-clause subsumption calls : 121
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 3
% 0.19/0.48 # BW rewrite match successes : 3
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 11781
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.014 s
% 0.19/0.48 # System time : 0.004 s
% 0.19/0.48 # Total time : 0.018 s
% 0.19/0.48 # Maximum resident set size: 2096 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.065 s
% 0.19/0.48 # System time : 0.008 s
% 0.19/0.48 # Total time : 0.073 s
% 0.19/0.48 # Maximum resident set size: 1752 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------