TSTP Solution File: NUM552+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM552+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:26:52 EDT 2024
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% 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/benchmark/theBenchmark.p',m__2227) ).
fof(m__,conjecture,
( aElementOf0(xx,xQ)
=> aElementOf0(xx,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.p',m__2270) ).
fof(c_0_3,hypothesis,
! [X131,X132,X133,X135,X136,X137,X139,X140,X141,X142] :
( aSet0(slbdtsldtrb0(xS,xk))
& ( aSet0(X131)
| ~ aElementOf0(X131,slbdtsldtrb0(xS,xk)) )
& ( ~ aElementOf0(X132,X131)
| aElementOf0(X132,xS)
| ~ aElementOf0(X131,slbdtsldtrb0(xS,xk)) )
& ( aSubsetOf0(X131,xS)
| ~ aElementOf0(X131,slbdtsldtrb0(xS,xk)) )
& ( sbrdtbr0(X131) = xk
| ~ aElementOf0(X131,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(esk12_1(X133),X133)
| ~ aSet0(X133)
| sbrdtbr0(X133) != xk
| aElementOf0(X133,slbdtsldtrb0(xS,xk)) )
& ( ~ aElementOf0(esk12_1(X133),xS)
| ~ aSet0(X133)
| sbrdtbr0(X133) != xk
| aElementOf0(X133,slbdtsldtrb0(xS,xk)) )
& ( ~ aSubsetOf0(X133,xS)
| sbrdtbr0(X133) != xk
| aElementOf0(X133,slbdtsldtrb0(xS,xk)) )
& aSet0(slbdtsldtrb0(xT,xk))
& ( aSet0(X135)
| ~ aElementOf0(X135,slbdtsldtrb0(xT,xk)) )
& ( ~ aElementOf0(X136,X135)
| aElementOf0(X136,xT)
| ~ aElementOf0(X135,slbdtsldtrb0(xT,xk)) )
& ( aSubsetOf0(X135,xT)
| ~ aElementOf0(X135,slbdtsldtrb0(xT,xk)) )
& ( sbrdtbr0(X135) = xk
| ~ aElementOf0(X135,slbdtsldtrb0(xT,xk)) )
& ( aElementOf0(esk13_1(X137),X137)
| ~ aSet0(X137)
| sbrdtbr0(X137) != xk
| aElementOf0(X137,slbdtsldtrb0(xT,xk)) )
& ( ~ aElementOf0(esk13_1(X137),xT)
| ~ aSet0(X137)
| sbrdtbr0(X137) != xk
| aElementOf0(X137,slbdtsldtrb0(xT,xk)) )
& ( ~ aSubsetOf0(X137,xT)
| sbrdtbr0(X137) != xk
| aElementOf0(X137,slbdtsldtrb0(xT,xk)) )
& ( ~ aElementOf0(X139,slbdtsldtrb0(xS,xk))
| aElementOf0(X139,slbdtsldtrb0(xT,xk)) )
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& ( aSet0(X140)
| ~ aElementOf0(X140,slbdtsldtrb0(xS,xk)) )
& ( ~ aElementOf0(X141,X140)
| aElementOf0(X141,xS)
| ~ aElementOf0(X140,slbdtsldtrb0(xS,xk)) )
& ( aSubsetOf0(X140,xS)
| ~ aElementOf0(X140,slbdtsldtrb0(xS,xk)) )
& ( sbrdtbr0(X140) = xk
| ~ aElementOf0(X140,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(esk14_1(X142),X142)
| ~ aSet0(X142)
| sbrdtbr0(X142) != xk
| aElementOf0(X142,slbdtsldtrb0(xS,xk)) )
& ( ~ aElementOf0(esk14_1(X142),xS)
| ~ aSet0(X142)
| sbrdtbr0(X142) != xk
| aElementOf0(X142,slbdtsldtrb0(xS,xk)) )
& ( ~ aSubsetOf0(X142,xS)
| sbrdtbr0(X142) != xk
| aElementOf0(X142,slbdtsldtrb0(xS,xk)) )
& aElementOf0(esk15_0,slbdtsldtrb0(xS,xk))
& slbdtsldtrb0(xS,xk) != 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)],[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,
! [X145] :
( aSet0(xQ)
& ( ~ aElementOf0(X145,xQ)
| aElementOf0(X145,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])])])]) ).
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)],[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.03/0.12 % Problem : NUM552+3 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 04:06:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29903 completed with status 0
% 0.21/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.21/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.21/0.53 # SAT001_MinMin_p005000_rr_RG with pid 29911 completed with status 0
% 0.21/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.21/0.53 # Preprocessing time : 0.003 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 68
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 154
% 0.21/0.53 # Removed in clause preprocessing : 6
% 0.21/0.53 # Initial clauses in saturation : 148
% 0.21/0.53 # Processed clauses : 300
% 0.21/0.53 # ...of these trivial : 3
% 0.21/0.53 # ...subsumed : 14
% 0.21/0.53 # ...remaining for further processing : 283
% 0.21/0.53 # Other redundant clauses eliminated : 35
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 1
% 0.21/0.53 # Generated clauses : 173
% 0.21/0.53 # ...of the previous two non-redundant : 113
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 15
% 0.21/0.53 # Paramodulations : 140
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 36
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 122
% 0.21/0.53 # ...of those cached : 94
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 114
% 0.21/0.53 # Positive orientable unit clauses : 39
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 7
% 0.21/0.53 # Non-unit-clauses : 68
% 0.21/0.53 # Current number of unprocessed clauses: 94
% 0.21/0.53 # ...number of literals in the above : 403
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 142
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 3831
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 1019
% 0.21/0.53 # Non-unit clause-clause subsumptions : 24
% 0.21/0.53 # Unit Clause-clause subsumption calls : 64
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 1
% 0.21/0.53 # BW rewrite match successes : 1
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 14781
% 0.21/0.53 # Search garbage collected termcells : 2758
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.028 s
% 0.21/0.53 # System time : 0.005 s
% 0.21/0.53 # Total time : 0.033 s
% 0.21/0.53 # Maximum resident set size: 2252 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.099 s
% 0.21/0.53 # System time : 0.019 s
% 0.21/0.53 # Total time : 0.118 s
% 0.21/0.53 # Maximum resident set size: 1772 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------