TSTP Solution File: RNG116+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG116+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 02:36:27 EDT 2024
% Result : Theorem 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 81 ( 26 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 98 ( 40 ~; 40 |; 15 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn 12 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(m__,conjecture,
? [X1,X2] :
( aElement0(X1)
& aElement0(X2)
& xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2456,hypothesis,
( aElementOf0(xk,slsdtgt0(xa))
& aElementOf0(xl,slsdtgt0(xb))
& xu = sdtpldt0(xk,xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2456) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(c_0_4,plain,
! [X39,X40,X41,X43,X44,X45,X47] :
( ( aSet0(X40)
| X40 != slsdtgt0(X39)
| ~ aElement0(X39) )
& ( aElement0(esk8_3(X39,X40,X41))
| ~ aElementOf0(X41,X40)
| X40 != slsdtgt0(X39)
| ~ aElement0(X39) )
& ( sdtasdt0(X39,esk8_3(X39,X40,X41)) = X41
| ~ aElementOf0(X41,X40)
| X40 != slsdtgt0(X39)
| ~ aElement0(X39) )
& ( ~ aElement0(X44)
| sdtasdt0(X39,X44) != X43
| aElementOf0(X43,X40)
| X40 != slsdtgt0(X39)
| ~ aElement0(X39) )
& ( ~ aElementOf0(esk9_2(X39,X45),X45)
| ~ aElement0(X47)
| sdtasdt0(X39,X47) != esk9_2(X39,X45)
| ~ aSet0(X45)
| X45 = slsdtgt0(X39)
| ~ aElement0(X39) )
& ( aElement0(esk10_2(X39,X45))
| aElementOf0(esk9_2(X39,X45),X45)
| ~ aSet0(X45)
| X45 = slsdtgt0(X39)
| ~ aElement0(X39) )
& ( sdtasdt0(X39,esk10_2(X39,X45)) = esk9_2(X39,X45)
| aElementOf0(esk9_2(X39,X45),X45)
| ~ aSet0(X45)
| X45 = slsdtgt0(X39)
| ~ aElement0(X39) ) ),
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)],[mDefPrIdeal])])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2] :
( aElement0(X1)
& aElement0(X2)
& xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_6,plain,
( sdtasdt0(X1,esk8_3(X1,X2,X3)) = X3
| ~ aElementOf0(X3,X2)
| X2 != slsdtgt0(X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( aElement0(esk8_3(X1,X2,X3))
| ~ aElementOf0(X3,X2)
| X2 != slsdtgt0(X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
! [X9,X10] :
( ~ aElement0(X9)
| ~ aElement0(X10)
| xu != sdtpldt0(sdtasdt0(xa,X9),sdtasdt0(xb,X10)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( sdtasdt0(X1,esk8_3(X1,slsdtgt0(X1),X2)) = X2
| ~ aElementOf0(X2,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xl,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2456]) ).
cnf(c_0_11,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_12,plain,
( aElement0(esk8_3(X1,slsdtgt0(X1),X2))
| ~ aElementOf0(X2,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( ~ aElement0(X1)
| ~ aElement0(X2)
| xu != sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
sdtasdt0(xb,esk8_3(xb,slsdtgt0(xb),xl)) = xl,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,hypothesis,
aElement0(esk8_3(xb,slsdtgt0(xb),xl)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10]),c_0_11])]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xk,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[m__2456]) ).
cnf(c_0_17,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_18,negated_conjecture,
( sdtpldt0(sdtasdt0(xa,X1),xl) != xu
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_19,hypothesis,
sdtasdt0(xa,esk8_3(xa,slsdtgt0(xa),xk)) = xk,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_16]),c_0_17])]) ).
cnf(c_0_20,hypothesis,
xu = sdtpldt0(xk,xl),
inference(split_conjunct,[status(thm)],[m__2456]) ).
cnf(c_0_21,hypothesis,
aElement0(esk8_3(xa,slsdtgt0(xa),xk)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG116+1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 12:12:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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/benchmark/theBenchmark.p
% 0.21/0.55 # Version: 3.1.0
% 0.21/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # new_bool_3 with pid 11328 completed with status 0
% 0.21/0.55 # Result found by new_bool_3
% 0.21/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.21/0.55 # G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 11331 completed with status 0
% 0.21/0.55 # Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 0.21/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.21/0.55 # Preprocessing time : 0.004 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Theorem
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 48
% 0.21/0.55 # Removed by relevancy pruning/SinE : 11
% 0.21/0.55 # Initial clauses : 86
% 0.21/0.55 # Removed in clause preprocessing : 4
% 0.21/0.55 # Initial clauses in saturation : 82
% 0.21/0.55 # Processed clauses : 491
% 0.21/0.55 # ...of these trivial : 1
% 0.21/0.55 # ...subsumed : 194
% 0.21/0.55 # ...remaining for further processing : 296
% 0.21/0.55 # Other redundant clauses eliminated : 15
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 3
% 0.21/0.55 # Backward-rewritten : 4
% 0.21/0.55 # Generated clauses : 786
% 0.21/0.55 # ...of the previous two non-redundant : 726
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 3
% 0.21/0.55 # Paramodulations : 773
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 15
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 722
% 0.21/0.55 # ...of those cached : 689
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 197
% 0.21/0.55 # Positive orientable unit clauses : 60
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 15
% 0.21/0.55 # Non-unit-clauses : 122
% 0.21/0.55 # Current number of unprocessed clauses: 370
% 0.21/0.55 # ...number of literals in the above : 1652
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 89
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 5121
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 1922
% 0.21/0.55 # Non-unit clause-clause subsumptions : 160
% 0.21/0.55 # Unit Clause-clause subsumption calls : 600
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 13
% 0.21/0.55 # BW rewrite match successes : 4
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 18825
% 0.21/0.55 # Search garbage collected termcells : 1556
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.035 s
% 0.21/0.55 # System time : 0.008 s
% 0.21/0.55 # Total time : 0.043 s
% 0.21/0.55 # Maximum resident set size: 2020 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.037 s
% 0.21/0.55 # System time : 0.010 s
% 0.21/0.55 # Total time : 0.047 s
% 0.21/0.55 # Maximum resident set size: 1756 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.56 % E exiting
%------------------------------------------------------------------------------