TSTP Solution File: RNG123+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG123+4 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:36:29 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 95 ( 22 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 104 ( 26 ~; 24 |; 48 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 10 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 21 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2699,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
& ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
& aElementOf0(xb,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2699) ).
fof(m__,conjecture,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xr )
| aElementOf0(xr,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2174,hypothesis,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xb,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,xI)
<=> ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 ) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(m__2690,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = smndt0(sdtasdt0(xq,xu)) )
& aElementOf0(smndt0(sdtasdt0(xq,xu)),xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2690) ).
fof(m__2718,hypothesis,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2718) ).
fof(c_0_5,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xb )
& aElementOf0(xb,xI) ),
inference(fof_simplification,[status(thm)],[m__2699]) ).
fof(c_0_6,negated_conjecture,
~ ( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xr )
| aElementOf0(xr,xI) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,hypothesis,
! [X122,X123,X124,X125,X127,X128,X129,X131,X132,X133,X136,X137,X138] :
( aSet0(xI)
& ( ~ aElementOf0(X123,xI)
| aElementOf0(sdtpldt0(X122,X123),xI)
| ~ aElementOf0(X122,xI) )
& ( ~ aElement0(X124)
| aElementOf0(sdtasdt0(X124,X122),xI)
| ~ aElementOf0(X122,xI) )
& aIdeal0(xI)
& ( aElement0(esk24_1(X125))
| ~ aElementOf0(X125,slsdtgt0(xa)) )
& ( sdtasdt0(xa,esk24_1(X125)) = X125
| ~ aElementOf0(X125,slsdtgt0(xa)) )
& ( ~ aElement0(X128)
| sdtasdt0(xa,X128) != X127
| aElementOf0(X127,slsdtgt0(xa)) )
& ( aElement0(esk25_1(X129))
| ~ aElementOf0(X129,slsdtgt0(xb)) )
& ( sdtasdt0(xb,esk25_1(X129)) = X129
| ~ aElementOf0(X129,slsdtgt0(xb)) )
& ( ~ aElement0(X132)
| sdtasdt0(xb,X132) != X131
| aElementOf0(X131,slsdtgt0(xb)) )
& ( aElementOf0(esk26_1(X133),slsdtgt0(xa))
| ~ aElementOf0(X133,xI) )
& ( aElementOf0(esk27_1(X133),slsdtgt0(xb))
| ~ aElementOf0(X133,xI) )
& ( sdtpldt0(esk26_1(X133),esk27_1(X133)) = X133
| ~ aElementOf0(X133,xI) )
& ( ~ aElementOf0(X137,slsdtgt0(xa))
| ~ aElementOf0(X138,slsdtgt0(xb))
| sdtpldt0(X137,X138) != X136
| aElementOf0(X136,xI) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
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__2174])])])])])])]) ).
fof(c_0_8,hypothesis,
( aElementOf0(esk42_0,slsdtgt0(xa))
& aElementOf0(esk43_0,slsdtgt0(xb))
& sdtpldt0(esk42_0,esk43_0) = smndt0(sdtasdt0(xq,xu))
& aElementOf0(smndt0(sdtasdt0(xq,xu)),xI) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2690])]) ).
fof(c_0_9,hypothesis,
( aElementOf0(esk44_0,slsdtgt0(xa))
& aElementOf0(esk45_0,slsdtgt0(xb))
& sdtpldt0(esk44_0,esk45_0) = xb
& aElementOf0(xb,xI) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_5])]) ).
fof(c_0_10,negated_conjecture,
! [X167,X168] :
( ( ~ aElementOf0(X167,slsdtgt0(xa))
| ~ aElementOf0(X168,slsdtgt0(xb))
| sdtpldt0(X167,X168) != xr )
& ~ aElementOf0(xr,xI) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_11,hypothesis,
( aElementOf0(sdtpldt0(X2,X1),xI)
| ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xI) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(split_conjunct,[status(thm)],[m__2718]) ).
cnf(c_0_13,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xb,xI),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ aElementOf0(xr,xI),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : RNG123+4 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 12:09:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12305 completed with status 0
% 0.20/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.20/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.20/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12313 completed with status 0
% 0.20/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.53 # Preprocessing time : 0.004 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 55
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 212
% 0.20/0.53 # Removed in clause preprocessing : 4
% 0.20/0.53 # Initial clauses in saturation : 208
% 0.20/0.53 # Processed clauses : 347
% 0.20/0.53 # ...of these trivial : 1
% 0.20/0.53 # ...subsumed : 11
% 0.20/0.53 # ...remaining for further processing : 335
% 0.20/0.53 # Other redundant clauses eliminated : 22
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 2
% 0.20/0.53 # Backward-rewritten : 1
% 0.20/0.53 # Generated clauses : 102
% 0.20/0.53 # ...of the previous two non-redundant : 58
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 1
% 0.20/0.53 # Paramodulations : 82
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 22
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 84
% 0.20/0.53 # ...of those cached : 57
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 115
% 0.20/0.53 # Positive orientable unit clauses : 59
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 15
% 0.20/0.53 # Non-unit-clauses : 41
% 0.20/0.53 # Current number of unprocessed clauses: 115
% 0.20/0.53 # ...number of literals in the above : 465
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 200
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 3098
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 882
% 0.20/0.53 # Non-unit clause-clause subsumptions : 7
% 0.20/0.53 # Unit Clause-clause subsumption calls : 54
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 1
% 0.20/0.53 # BW rewrite match successes : 1
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 14437
% 0.20/0.53 # Search garbage collected termcells : 2715
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.028 s
% 0.20/0.53 # System time : 0.005 s
% 0.20/0.53 # Total time : 0.033 s
% 0.20/0.53 # Maximum resident set size: 2328 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.095 s
% 0.20/0.53 # System time : 0.010 s
% 0.20/0.53 # Total time : 0.105 s
% 0.20/0.53 # Maximum resident set size: 1776 pages
% 0.20/0.53 % E---3.1 exiting
% 0.20/0.53 % E exiting
%------------------------------------------------------------------------------