TSTP Solution File: NUM552+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM552+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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.50s 0.56s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 150 ( 25 equ)
% Maximal formula atoms : 67 ( 7 avg)
% Number of connectives : 185 ( 54 ~; 55 |; 59 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn; 22 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2227,hypothesis,
( aSet0(slbdtsldtrb0(xS,xk))
& ! [X1] :
( ( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& sbrdtbr0(X1) = xk ) )
& ( ( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) ) )
| aSubsetOf0(X1,xS) )
& sbrdtbr0(X1) = xk )
=> aElementOf0(X1,slbdtsldtrb0(xS,xk)) ) )
& aSet0(slbdtsldtrb0(xT,xk))
& ! [X1] :
( ( aElementOf0(X1,slbdtsldtrb0(xT,xk))
=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xT) )
& aSubsetOf0(X1,xT)
& sbrdtbr0(X1) = xk ) )
& ( ( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xT) ) )
| aSubsetOf0(X1,xT) )
& sbrdtbr0(X1) = xk )
=> aElementOf0(X1,slbdtsldtrb0(xT,xk)) ) )
& ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> aElementOf0(X1,slbdtsldtrb0(xT,xk)) )
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& ~ ( ! [X1] :
( ( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& sbrdtbr0(X1) = xk ) )
& ( ( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) ) )
| aSubsetOf0(X1,xS) )
& sbrdtbr0(X1) = xk )
=> aElementOf0(X1,slbdtsldtrb0(xS,xk)) ) )
=> ( ~ ? [X1] : aElementOf0(X1,slbdtsldtrb0(xS,xk))
| slbdtsldtrb0(xS,xk) = slcrc0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Oo0FGF5UYo/E---3.1_16455.p',m__2227) ).
fof(m__,conjecture,
( aElementOf0(xx,xQ)
=> aElementOf0(xx,xT) ),
file('/export/starexec/sandbox/tmp/tmp.Oo0FGF5UYo/E---3.1_16455.p',m__) ).
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/sandbox/tmp/tmp.Oo0FGF5UYo/E---3.1_16455.p',m__2270) ).
fof(c_0_3,hypothesis,
! [X123,X124,X125,X127,X128,X129,X131,X132,X133,X134] :
( aSet0(slbdtsldtrb0(xS,xk))
& ( aSet0(X123)
| ~ aElementOf0(X123,slbdtsldtrb0(xS,xk)) )
& ( ~ aElementOf0(X124,X123)
| aElementOf0(X124,xS)
| ~ aElementOf0(X123,slbdtsldtrb0(xS,xk)) )
& ( aSubsetOf0(X123,xS)
| ~ aElementOf0(X123,slbdtsldtrb0(xS,xk)) )
& ( sbrdtbr0(X123) = xk
| ~ aElementOf0(X123,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(esk12_1(X125),X125)
| ~ aSet0(X125)
| sbrdtbr0(X125) != xk
| aElementOf0(X125,slbdtsldtrb0(xS,xk)) )
& ( ~ aElementOf0(esk12_1(X125),xS)
| ~ aSet0(X125)
| sbrdtbr0(X125) != xk
| aElementOf0(X125,slbdtsldtrb0(xS,xk)) )
& ( ~ aSubsetOf0(X125,xS)
| sbrdtbr0(X125) != xk
| aElementOf0(X125,slbdtsldtrb0(xS,xk)) )
& aSet0(slbdtsldtrb0(xT,xk))
& ( aSet0(X127)
| ~ aElementOf0(X127,slbdtsldtrb0(xT,xk)) )
& ( ~ aElementOf0(X128,X127)
| aElementOf0(X128,xT)
| ~ aElementOf0(X127,slbdtsldtrb0(xT,xk)) )
& ( aSubsetOf0(X127,xT)
| ~ aElementOf0(X127,slbdtsldtrb0(xT,xk)) )
& ( sbrdtbr0(X127) = xk
| ~ aElementOf0(X127,slbdtsldtrb0(xT,xk)) )
& ( aElementOf0(esk13_1(X129),X129)
| ~ aSet0(X129)
| sbrdtbr0(X129) != xk
| aElementOf0(X129,slbdtsldtrb0(xT,xk)) )
& ( ~ aElementOf0(esk13_1(X129),xT)
| ~ aSet0(X129)
| sbrdtbr0(X129) != xk
| aElementOf0(X129,slbdtsldtrb0(xT,xk)) )
& ( ~ aSubsetOf0(X129,xT)
| sbrdtbr0(X129) != xk
| aElementOf0(X129,slbdtsldtrb0(xT,xk)) )
& ( ~ aElementOf0(X131,slbdtsldtrb0(xS,xk))
| aElementOf0(X131,slbdtsldtrb0(xT,xk)) )
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& ( aSet0(X132)
| ~ aElementOf0(X132,slbdtsldtrb0(xS,xk)) )
& ( ~ aElementOf0(X133,X132)
| aElementOf0(X133,xS)
| ~ aElementOf0(X132,slbdtsldtrb0(xS,xk)) )
& ( aSubsetOf0(X132,xS)
| ~ aElementOf0(X132,slbdtsldtrb0(xS,xk)) )
& ( sbrdtbr0(X132) = xk
| ~ aElementOf0(X132,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(esk14_1(X134),X134)
| ~ aSet0(X134)
| sbrdtbr0(X134) != xk
| aElementOf0(X134,slbdtsldtrb0(xS,xk)) )
& ( ~ aElementOf0(esk14_1(X134),xS)
| ~ aSet0(X134)
| sbrdtbr0(X134) != xk
| aElementOf0(X134,slbdtsldtrb0(xS,xk)) )
& ( ~ aSubsetOf0(X134,xS)
| sbrdtbr0(X134) != xk
| aElementOf0(X134,slbdtsldtrb0(xS,xk)) )
& aElementOf0(esk15_0,slbdtsldtrb0(xS,xk))
& slbdtsldtrb0(xS,xk) != 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)],[m__2227])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ( aElementOf0(xx,xQ)
=> aElementOf0(xx,xT) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_5,hypothesis,
( aSubsetOf0(X1,xT)
| ~ aElementOf0(X1,slbdtsldtrb0(xT,xk)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
( aElementOf0(X1,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X1,slbdtsldtrb0(xS,xk)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_7,hypothesis,
! [X137] :
( aSet0(xQ)
& ( ~ aElementOf0(X137,xQ)
| aElementOf0(X137,xS) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2270])])]) ).
cnf(c_0_8,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,X2)
| ~ aElementOf0(X2,slbdtsldtrb0(xT,xk)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,hypothesis,
( aElementOf0(X1,slbdtsldtrb0(xT,xk))
| ~ aSubsetOf0(X1,xT)
| sbrdtbr0(X1) != xk ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_10,negated_conjecture,
( aElementOf0(xx,xQ)
& ~ aElementOf0(xx,xT) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
cnf(c_0_11,hypothesis,
( aSubsetOf0(X1,xT)
| ~ aElementOf0(X1,slbdtsldtrb0(xS,xk)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
( aElementOf0(X1,xT)
| sbrdtbr0(X2) != xk
| ~ aSubsetOf0(X2,xT)
| ~ aElementOf0(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
aElementOf0(xx,xQ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,hypothesis,
aSubsetOf0(xQ,xT),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[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])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM552+3 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 13:31:33 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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.Oo0FGF5UYo/E---3.1_16455.p
% 0.50/0.55 # Version: 3.1pre001
% 0.50/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.55 # Starting sh5l with 300s (1) cores
% 0.50/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 16533 completed with status 0
% 0.50/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.50/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.55 # No SInE strategy applied
% 0.50/0.55 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.50/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.55 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.50/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.50/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.50/0.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.50/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.50/0.56 # SAT001_MinMin_p005000_rr_RG with pid 16542 completed with status 0
% 0.50/0.56 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.50/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.56 # No SInE strategy applied
% 0.50/0.56 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.50/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.56 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.50/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.50/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.50/0.56 # Preprocessing time : 0.003 s
% 0.50/0.56 # Presaturation interreduction done
% 0.50/0.56
% 0.50/0.56 # Proof found!
% 0.50/0.56 # SZS status Theorem
% 0.50/0.56 # SZS output start CNFRefutation
% See solution above
% 0.50/0.56 # Parsed axioms : 68
% 0.50/0.56 # Removed by relevancy pruning/SinE : 0
% 0.50/0.56 # Initial clauses : 154
% 0.50/0.56 # Removed in clause preprocessing : 6
% 0.50/0.56 # Initial clauses in saturation : 148
% 0.50/0.56 # Processed clauses : 300
% 0.50/0.56 # ...of these trivial : 3
% 0.50/0.56 # ...subsumed : 14
% 0.50/0.56 # ...remaining for further processing : 283
% 0.50/0.56 # Other redundant clauses eliminated : 35
% 0.50/0.56 # Clauses deleted for lack of memory : 0
% 0.50/0.56 # Backward-subsumed : 0
% 0.50/0.56 # Backward-rewritten : 1
% 0.50/0.56 # Generated clauses : 173
% 0.50/0.56 # ...of the previous two non-redundant : 113
% 0.50/0.56 # ...aggressively subsumed : 0
% 0.50/0.56 # Contextual simplify-reflections : 15
% 0.50/0.56 # Paramodulations : 140
% 0.50/0.56 # Factorizations : 0
% 0.50/0.56 # NegExts : 0
% 0.50/0.56 # Equation resolutions : 36
% 0.50/0.56 # Total rewrite steps : 122
% 0.50/0.56 # Propositional unsat checks : 0
% 0.50/0.56 # Propositional check models : 0
% 0.50/0.56 # Propositional check unsatisfiable : 0
% 0.50/0.56 # Propositional clauses : 0
% 0.50/0.56 # Propositional clauses after purity: 0
% 0.50/0.56 # Propositional unsat core size : 0
% 0.50/0.56 # Propositional preprocessing time : 0.000
% 0.50/0.56 # Propositional encoding time : 0.000
% 0.50/0.56 # Propositional solver time : 0.000
% 0.50/0.56 # Success case prop preproc time : 0.000
% 0.50/0.56 # Success case prop encoding time : 0.000
% 0.50/0.56 # Success case prop solver time : 0.000
% 0.50/0.56 # Current number of processed clauses : 114
% 0.50/0.56 # Positive orientable unit clauses : 39
% 0.50/0.56 # Positive unorientable unit clauses: 0
% 0.50/0.56 # Negative unit clauses : 7
% 0.50/0.56 # Non-unit-clauses : 68
% 0.50/0.56 # Current number of unprocessed clauses: 94
% 0.50/0.56 # ...number of literals in the above : 403
% 0.50/0.56 # Current number of archived formulas : 0
% 0.50/0.56 # Current number of archived clauses : 142
% 0.50/0.56 # Clause-clause subsumption calls (NU) : 3831
% 0.50/0.56 # Rec. Clause-clause subsumption calls : 1019
% 0.50/0.56 # Non-unit clause-clause subsumptions : 24
% 0.50/0.56 # Unit Clause-clause subsumption calls : 64
% 0.50/0.56 # Rewrite failures with RHS unbound : 0
% 0.50/0.56 # BW rewrite match attempts : 1
% 0.50/0.56 # BW rewrite match successes : 1
% 0.50/0.56 # Condensation attempts : 0
% 0.50/0.56 # Condensation successes : 0
% 0.50/0.56 # Termbank termtop insertions : 13035
% 0.50/0.56
% 0.50/0.56 # -------------------------------------------------
% 0.50/0.56 # User time : 0.025 s
% 0.50/0.56 # System time : 0.005 s
% 0.50/0.56 # Total time : 0.030 s
% 0.50/0.56 # Maximum resident set size: 2264 pages
% 0.50/0.56
% 0.50/0.56 # -------------------------------------------------
% 0.50/0.56 # User time : 0.083 s
% 0.50/0.56 # System time : 0.014 s
% 0.50/0.56 # Total time : 0.098 s
% 0.50/0.56 # Maximum resident set size: 1756 pages
% 0.50/0.56 % E---3.1 exiting
% 0.50/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------