TSTP Solution File: RNG124+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG124+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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 : 600s
% DateTime : Mon Jul 18 20:27:00 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 5 unt; 0 def)
% Number of atoms : 47 ( 17 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 49 ( 14 ~; 11 |; 23 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 4 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2273,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2273) ).
fof(m__2666,hypothesis,
( aElement0(xq)
& aElement0(xr)
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& ( xr = sz00
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2666) ).
fof(m__2673,hypothesis,
xr != sz00,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2673) ).
fof(m__2729,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xr )
& aElementOf0(xr,xI) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2729) ).
fof(c_0_4,hypothesis,
! [X6,X7,X8] :
( aElementOf0(esk17_0,slsdtgt0(xa))
& aElementOf0(esk18_0,slsdtgt0(xb))
& sdtpldt0(esk17_0,esk18_0) = xu
& aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X7,slsdtgt0(xa))
| ~ aElementOf0(X8,slsdtgt0(xb))
| sdtpldt0(X7,X8) != X6
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) )
& ( ~ aElementOf0(X6,xI)
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[m__2273])])])])])])])]) ).
cnf(c_0_5,hypothesis,
( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
| xr = sz00 ),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_6,hypothesis,
xr != sz00,
inference(split_conjunct,[status(thm)],[m__2673]) ).
fof(c_0_7,hypothesis,
( aElementOf0(esk26_0,slsdtgt0(xa))
& aElementOf0(esk27_0,slsdtgt0(xb))
& sdtpldt0(esk26_0,esk27_0) = xr
& aElementOf0(xr,xI) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__2729])])])]) ).
cnf(c_0_8,hypothesis,
( X1 = sz00
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu))
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,hypothesis,
iLess0(sbrdtbr0(xr),sbrdtbr0(xu)),
inference(sr,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xr,xI),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : RNG124+4 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 08:50:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.023 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 12
% 0.22/1.40 # Proof object clause steps : 6
% 0.22/1.40 # Proof object formula steps : 6
% 0.22/1.40 # Proof object conjectures : 0
% 0.22/1.40 # Proof object clause conjectures : 0
% 0.22/1.40 # Proof object formula conjectures : 0
% 0.22/1.40 # Proof object initial clauses used : 4
% 0.22/1.40 # Proof object initial formulas used : 4
% 0.22/1.40 # Proof object generating inferences : 1
% 0.22/1.40 # Proof object simplifying inferences : 4
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 56
% 0.22/1.40 # Removed by relevancy pruning/SinE : 5
% 0.22/1.40 # Initial clauses : 197
% 0.22/1.40 # Removed in clause preprocessing : 5
% 0.22/1.40 # Initial clauses in saturation : 192
% 0.22/1.40 # Processed clauses : 119
% 0.22/1.40 # ...of these trivial : 1
% 0.22/1.40 # ...subsumed : 5
% 0.22/1.40 # ...remaining for further processing : 113
% 0.22/1.40 # Other redundant clauses eliminated : 2
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 1
% 0.22/1.40 # Generated clauses : 155
% 0.22/1.40 # ...of the previous two non-trivial : 117
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 150
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 5
% 0.22/1.40 # Current number of processed clauses : 112
% 0.22/1.40 # Positive orientable unit clauses : 60
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 5
% 0.22/1.40 # Non-unit-clauses : 47
% 0.22/1.40 # Current number of unprocessed clauses: 190
% 0.22/1.40 # ...number of literals in the above : 606
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 1
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 206
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 175
% 0.22/1.40 # Non-unit clause-clause subsumptions : 2
% 0.22/1.40 # Unit Clause-clause subsumption calls : 2
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 1
% 0.22/1.40 # BW rewrite match successes : 1
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 11355
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.028 s
% 0.22/1.40 # System time : 0.000 s
% 0.22/1.40 # Total time : 0.028 s
% 0.22/1.40 # Maximum resident set size: 3636 pages
%------------------------------------------------------------------------------