TSTP Solution File: COM013+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM013+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 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 : Mon May 20 19:09:59 EDT 2024
% Result : Theorem 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 75 ( 17 unt; 0 def)
% Number of atoms : 400 ( 8 equ)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 532 ( 207 ~; 196 |; 90 &)
% ( 12 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 207 ( 173 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f158,plain,
$false,
inference(subsumption_resolution,[],[f155,f149]) ).
fof(f149,plain,
sdtmndtasgtdt0(sK11(xR,sK12),xR,sK13(sK11(xR,sK12))),
inference(unit_resulting_resolution,[],[f110,f135,f142,f107]) ).
fof(f107,plain,
! [X2,X0,X1] :
( ~ aNormalFormOfIn0(X2,X0,X1)
| sdtmndtasgtdt0(X0,X1,X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0,X1] :
( ! [X2] :
( ( aNormalFormOfIn0(X2,X0,X1)
| aReductOfIn0(sK11(X1,X2),X2,X1)
| ~ sdtmndtasgtdt0(X0,X1,X2)
| ~ aElement0(X2) )
& ( ( ! [X4] : ~ aReductOfIn0(X4,X2,X1)
& sdtmndtasgtdt0(X0,X1,X2)
& aElement0(X2) )
| ~ aNormalFormOfIn0(X2,X0,X1) ) )
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f65,f66]) ).
fof(f66,plain,
! [X1,X2] :
( ? [X3] : aReductOfIn0(X3,X2,X1)
=> aReductOfIn0(sK11(X1,X2),X2,X1) ),
introduced(choice_axiom,[]) ).
fof(f65,plain,
! [X0,X1] :
( ! [X2] :
( ( aNormalFormOfIn0(X2,X0,X1)
| ? [X3] : aReductOfIn0(X3,X2,X1)
| ~ sdtmndtasgtdt0(X0,X1,X2)
| ~ aElement0(X2) )
& ( ( ! [X4] : ~ aReductOfIn0(X4,X2,X1)
& sdtmndtasgtdt0(X0,X1,X2)
& aElement0(X2) )
| ~ aNormalFormOfIn0(X2,X0,X1) ) )
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(rectify,[],[f64]) ).
fof(f64,plain,
! [X0,X1] :
( ! [X2] :
( ( aNormalFormOfIn0(X2,X0,X1)
| ? [X3] : aReductOfIn0(X3,X2,X1)
| ~ sdtmndtasgtdt0(X0,X1,X2)
| ~ aElement0(X2) )
& ( ( ! [X3] : ~ aReductOfIn0(X3,X2,X1)
& sdtmndtasgtdt0(X0,X1,X2)
& aElement0(X2) )
| ~ aNormalFormOfIn0(X2,X0,X1) ) )
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f63]) ).
fof(f63,plain,
! [X0,X1] :
( ! [X2] :
( ( aNormalFormOfIn0(X2,X0,X1)
| ? [X3] : aReductOfIn0(X3,X2,X1)
| ~ sdtmndtasgtdt0(X0,X1,X2)
| ~ aElement0(X2) )
& ( ( ! [X3] : ~ aReductOfIn0(X3,X2,X1)
& sdtmndtasgtdt0(X0,X1,X2)
& aElement0(X2) )
| ~ aNormalFormOfIn0(X2,X0,X1) ) )
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(nnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0,X1] :
( ! [X2] :
( aNormalFormOfIn0(X2,X0,X1)
<=> ( ! [X3] : ~ aReductOfIn0(X3,X2,X1)
& sdtmndtasgtdt0(X0,X1,X2)
& aElement0(X2) ) )
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ! [X2] :
( aNormalFormOfIn0(X2,X0,X1)
<=> ( ! [X3] : ~ aReductOfIn0(X3,X2,X1)
& sdtmndtasgtdt0(X0,X1,X2)
& aElement0(X2) ) )
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0,X1] :
( ( aRewritingSystem0(X1)
& aElement0(X0) )
=> ! [X2] :
( aNormalFormOfIn0(X2,X0,X1)
<=> ( ~ ? [X3] : aReductOfIn0(X3,X2,X1)
& sdtmndtasgtdt0(X0,X1,X2)
& aElement0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNFRDef) ).
fof(f142,plain,
aNormalFormOfIn0(sK13(sK11(xR,sK12)),sK11(xR,sK12),xR),
inference(unit_resulting_resolution,[],[f135,f140,f113]) ).
fof(f113,plain,
! [X2] :
( aNormalFormOfIn0(sK13(X2),X2,xR)
| ~ iLess0(X2,sK12)
| ~ aElement0(X2) ),
inference(cnf_transformation,[],[f71]) ).
fof(f71,plain,
( ! [X1] : ~ aNormalFormOfIn0(X1,sK12,xR)
& ! [X2] :
( aNormalFormOfIn0(sK13(X2),X2,xR)
| ~ iLess0(X2,sK12)
| ~ aElement0(X2) )
& aElement0(sK12) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13])],[f68,f70,f69]) ).
fof(f69,plain,
( ? [X0] :
( ! [X1] : ~ aNormalFormOfIn0(X1,X0,xR)
& ! [X2] :
( ? [X3] : aNormalFormOfIn0(X3,X2,xR)
| ~ iLess0(X2,X0)
| ~ aElement0(X2) )
& aElement0(X0) )
=> ( ! [X1] : ~ aNormalFormOfIn0(X1,sK12,xR)
& ! [X2] :
( ? [X3] : aNormalFormOfIn0(X3,X2,xR)
| ~ iLess0(X2,sK12)
| ~ aElement0(X2) )
& aElement0(sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f70,plain,
! [X2] :
( ? [X3] : aNormalFormOfIn0(X3,X2,xR)
=> aNormalFormOfIn0(sK13(X2),X2,xR) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
? [X0] :
( ! [X1] : ~ aNormalFormOfIn0(X1,X0,xR)
& ! [X2] :
( ? [X3] : aNormalFormOfIn0(X3,X2,xR)
| ~ iLess0(X2,X0)
| ~ aElement0(X2) )
& aElement0(X0) ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
? [X0] :
( ! [X3] : ~ aNormalFormOfIn0(X3,X0,xR)
& ! [X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,xR)
| ~ iLess0(X1,X0)
| ~ aElement0(X1) )
& aElement0(X0) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
? [X0] :
( ! [X3] : ~ aNormalFormOfIn0(X3,X0,xR)
& ! [X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,xR)
| ~ iLess0(X1,X0)
| ~ aElement0(X1) )
& aElement0(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0] :
( aElement0(X0)
=> ( ! [X1] :
( aElement0(X1)
=> ( iLess0(X1,X0)
=> ? [X2] : aNormalFormOfIn0(X2,X1,xR) ) )
=> ? [X3] : aNormalFormOfIn0(X3,X0,xR) ) ),
inference(rectify,[],[f16]) ).
fof(f16,negated_conjecture,
~ ! [X0] :
( aElement0(X0)
=> ( ! [X1] :
( aElement0(X1)
=> ( iLess0(X1,X0)
=> ? [X2] : aNormalFormOfIn0(X2,X1,xR) ) )
=> ? [X1] : aNormalFormOfIn0(X1,X0,xR) ) ),
inference(negated_conjecture,[],[f15]) ).
fof(f15,conjecture,
! [X0] :
( aElement0(X0)
=> ( ! [X1] :
( aElement0(X1)
=> ( iLess0(X1,X0)
=> ? [X2] : aNormalFormOfIn0(X2,X1,xR) ) )
=> ? [X1] : aNormalFormOfIn0(X1,X0,xR) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f140,plain,
iLess0(sK11(xR,sK12),sK12),
inference(unit_resulting_resolution,[],[f110,f111,f112,f135,f133,f101]) ).
fof(f101,plain,
! [X3,X0,X4] :
( ~ sdtmndtplgtdt0(X3,X0,X4)
| iLess0(X4,X3)
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0] :
( ( ( isTerminating0(X0)
| ( ~ iLess0(sK10(X0),sK9(X0))
& sdtmndtplgtdt0(sK9(X0),X0,sK10(X0))
& aElement0(sK10(X0))
& aElement0(sK9(X0)) ) )
& ( ! [X3,X4] :
( iLess0(X4,X3)
| ~ sdtmndtplgtdt0(X3,X0,X4)
| ~ aElement0(X4)
| ~ aElement0(X3) )
| ~ isTerminating0(X0) ) )
| ~ aRewritingSystem0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f60,f61]) ).
fof(f61,plain,
! [X0] :
( ? [X1,X2] :
( ~ iLess0(X2,X1)
& sdtmndtplgtdt0(X1,X0,X2)
& aElement0(X2)
& aElement0(X1) )
=> ( ~ iLess0(sK10(X0),sK9(X0))
& sdtmndtplgtdt0(sK9(X0),X0,sK10(X0))
& aElement0(sK10(X0))
& aElement0(sK9(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
! [X0] :
( ( ( isTerminating0(X0)
| ? [X1,X2] :
( ~ iLess0(X2,X1)
& sdtmndtplgtdt0(X1,X0,X2)
& aElement0(X2)
& aElement0(X1) ) )
& ( ! [X3,X4] :
( iLess0(X4,X3)
| ~ sdtmndtplgtdt0(X3,X0,X4)
| ~ aElement0(X4)
| ~ aElement0(X3) )
| ~ isTerminating0(X0) ) )
| ~ aRewritingSystem0(X0) ),
inference(rectify,[],[f59]) ).
fof(f59,plain,
! [X0] :
( ( ( isTerminating0(X0)
| ? [X1,X2] :
( ~ iLess0(X2,X1)
& sdtmndtplgtdt0(X1,X0,X2)
& aElement0(X2)
& aElement0(X1) ) )
& ( ! [X1,X2] :
( iLess0(X2,X1)
| ~ sdtmndtplgtdt0(X1,X0,X2)
| ~ aElement0(X2)
| ~ aElement0(X1) )
| ~ isTerminating0(X0) ) )
| ~ aRewritingSystem0(X0) ),
inference(nnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0] :
( ( isTerminating0(X0)
<=> ! [X1,X2] :
( iLess0(X2,X1)
| ~ sdtmndtplgtdt0(X1,X0,X2)
| ~ aElement0(X2)
| ~ aElement0(X1) ) )
| ~ aRewritingSystem0(X0) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X0] :
( ( isTerminating0(X0)
<=> ! [X1,X2] :
( iLess0(X2,X1)
| ~ sdtmndtplgtdt0(X1,X0,X2)
| ~ aElement0(X2)
| ~ aElement0(X1) ) )
| ~ aRewritingSystem0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0] :
( aRewritingSystem0(X0)
=> ( isTerminating0(X0)
<=> ! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> ( sdtmndtplgtdt0(X1,X0,X2)
=> iLess0(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTermin) ).
fof(f133,plain,
sdtmndtplgtdt0(sK12,xR,sK11(xR,sK12)),
inference(unit_resulting_resolution,[],[f112,f110,f131,f118]) ).
fof(f118,plain,
! [X2,X0,X1] :
( sdtmndtplgtdt0(X0,X1,X2)
| ~ aReductOfIn0(X2,X0,X1)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(subsumption_resolution,[],[f76,f72]) ).
fof(f72,plain,
! [X2,X0,X1] :
( ~ aReductOfIn0(X2,X0,X1)
| aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ! [X2] :
( aElement0(X2)
| ~ aReductOfIn0(X2,X0,X1) )
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ! [X2] :
( aElement0(X2)
| ~ aReductOfIn0(X2,X0,X1) )
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( ( aRewritingSystem0(X1)
& aElement0(X0) )
=> ! [X2] :
( aReductOfIn0(X2,X0,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mReduct) ).
fof(f76,plain,
! [X2,X0,X1] :
( sdtmndtplgtdt0(X0,X1,X2)
| ~ aReductOfIn0(X2,X0,X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( ( sdtmndtplgtdt0(X0,X1,X2)
| ( ! [X3] :
( ~ sdtmndtplgtdt0(X3,X1,X2)
| ~ aReductOfIn0(X3,X0,X1)
| ~ aElement0(X3) )
& ~ aReductOfIn0(X2,X0,X1) ) )
& ( ( sdtmndtplgtdt0(sK0(X0,X1,X2),X1,X2)
& aReductOfIn0(sK0(X0,X1,X2),X0,X1)
& aElement0(sK0(X0,X1,X2)) )
| aReductOfIn0(X2,X0,X1)
| ~ sdtmndtplgtdt0(X0,X1,X2) ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f44,f45]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ? [X4] :
( sdtmndtplgtdt0(X4,X1,X2)
& aReductOfIn0(X4,X0,X1)
& aElement0(X4) )
=> ( sdtmndtplgtdt0(sK0(X0,X1,X2),X1,X2)
& aReductOfIn0(sK0(X0,X1,X2),X0,X1)
& aElement0(sK0(X0,X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( ( sdtmndtplgtdt0(X0,X1,X2)
| ( ! [X3] :
( ~ sdtmndtplgtdt0(X3,X1,X2)
| ~ aReductOfIn0(X3,X0,X1)
| ~ aElement0(X3) )
& ~ aReductOfIn0(X2,X0,X1) ) )
& ( ? [X4] :
( sdtmndtplgtdt0(X4,X1,X2)
& aReductOfIn0(X4,X0,X1)
& aElement0(X4) )
| aReductOfIn0(X2,X0,X1)
| ~ sdtmndtplgtdt0(X0,X1,X2) ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(rectify,[],[f43]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( ( sdtmndtplgtdt0(X0,X1,X2)
| ( ! [X3] :
( ~ sdtmndtplgtdt0(X3,X1,X2)
| ~ aReductOfIn0(X3,X0,X1)
| ~ aElement0(X3) )
& ~ aReductOfIn0(X2,X0,X1) ) )
& ( ? [X3] :
( sdtmndtplgtdt0(X3,X1,X2)
& aReductOfIn0(X3,X0,X1)
& aElement0(X3) )
| aReductOfIn0(X2,X0,X1)
| ~ sdtmndtplgtdt0(X0,X1,X2) ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( ( sdtmndtplgtdt0(X0,X1,X2)
| ( ! [X3] :
( ~ sdtmndtplgtdt0(X3,X1,X2)
| ~ aReductOfIn0(X3,X0,X1)
| ~ aElement0(X3) )
& ~ aReductOfIn0(X2,X0,X1) ) )
& ( ? [X3] :
( sdtmndtplgtdt0(X3,X1,X2)
& aReductOfIn0(X3,X0,X1)
& aElement0(X3) )
| aReductOfIn0(X2,X0,X1)
| ~ sdtmndtplgtdt0(X0,X1,X2) ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(nnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( sdtmndtplgtdt0(X0,X1,X2)
<=> ( ? [X3] :
( sdtmndtplgtdt0(X3,X1,X2)
& aReductOfIn0(X3,X0,X1)
& aElement0(X3) )
| aReductOfIn0(X2,X0,X1) ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( sdtmndtplgtdt0(X0,X1,X2)
<=> ( ? [X3] :
( sdtmndtplgtdt0(X3,X1,X2)
& aReductOfIn0(X3,X0,X1)
& aElement0(X3) )
| aReductOfIn0(X2,X0,X1) ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( ( aElement0(X2)
& aRewritingSystem0(X1)
& aElement0(X0) )
=> ( sdtmndtplgtdt0(X0,X1,X2)
<=> ( ? [X3] :
( sdtmndtplgtdt0(X3,X1,X2)
& aReductOfIn0(X3,X0,X1)
& aElement0(X3) )
| aReductOfIn0(X2,X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCDef) ).
fof(f131,plain,
aReductOfIn0(sK11(xR,sK12),sK12,xR),
inference(unit_resulting_resolution,[],[f112,f110,f112,f114,f125,f109]) ).
fof(f109,plain,
! [X2,X0,X1] :
( ~ sdtmndtasgtdt0(X0,X1,X2)
| aReductOfIn0(sK11(X1,X2),X2,X1)
| aNormalFormOfIn0(X2,X0,X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f67]) ).
fof(f125,plain,
sdtmndtasgtdt0(sK12,xR,sK12),
inference(unit_resulting_resolution,[],[f110,f112,f116]) ).
fof(f116,plain,
! [X2,X1] :
( sdtmndtasgtdt0(X2,X1,X2)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1) ),
inference(duplicate_literal_removal,[],[f115]) ).
fof(f115,plain,
! [X2,X1] :
( sdtmndtasgtdt0(X2,X1,X2)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(equality_resolution,[],[f80]) ).
fof(f80,plain,
! [X2,X0,X1] :
( sdtmndtasgtdt0(X0,X1,X2)
| X0 != X2
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ( ( sdtmndtasgtdt0(X0,X1,X2)
| ( ~ sdtmndtplgtdt0(X0,X1,X2)
& X0 != X2 ) )
& ( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2
| ~ sdtmndtasgtdt0(X0,X1,X2) ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( ( sdtmndtasgtdt0(X0,X1,X2)
| ( ~ sdtmndtplgtdt0(X0,X1,X2)
& X0 != X2 ) )
& ( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2
| ~ sdtmndtasgtdt0(X0,X1,X2) ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(nnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( sdtmndtasgtdt0(X0,X1,X2)
<=> ( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2 ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( sdtmndtasgtdt0(X0,X1,X2)
<=> ( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2 ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( aElement0(X2)
& aRewritingSystem0(X1)
& aElement0(X0) )
=> ( sdtmndtasgtdt0(X0,X1,X2)
<=> ( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRDef) ).
fof(f114,plain,
! [X1] : ~ aNormalFormOfIn0(X1,sK12,xR),
inference(cnf_transformation,[],[f71]) ).
fof(f112,plain,
aElement0(sK12),
inference(cnf_transformation,[],[f71]) ).
fof(f111,plain,
isTerminating0(xR),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
( isTerminating0(xR)
& aRewritingSystem0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__587) ).
fof(f135,plain,
aElement0(sK11(xR,sK12)),
inference(unit_resulting_resolution,[],[f112,f110,f131,f72]) ).
fof(f110,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f14]) ).
fof(f155,plain,
~ sdtmndtasgtdt0(sK11(xR,sK12),xR,sK13(sK11(xR,sK12))),
inference(unit_resulting_resolution,[],[f112,f110,f135,f141,f150,f153,f82]) ).
fof(f82,plain,
! [X2,X3,X0,X1] :
( ~ sdtmndtasgtdt0(X0,X1,X2)
| ~ sdtmndtasgtdt0(X2,X1,X3)
| sdtmndtasgtdt0(X0,X1,X3)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1,X2,X3] :
( sdtmndtasgtdt0(X0,X1,X3)
| ~ sdtmndtasgtdt0(X2,X1,X3)
| ~ sdtmndtasgtdt0(X0,X1,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X0,X1,X2,X3] :
( sdtmndtasgtdt0(X0,X1,X3)
| ~ sdtmndtasgtdt0(X2,X1,X3)
| ~ sdtmndtasgtdt0(X0,X1,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1,X2,X3] :
( ( aElement0(X3)
& aElement0(X2)
& aRewritingSystem0(X1)
& aElement0(X0) )
=> ( ( sdtmndtasgtdt0(X2,X1,X3)
& sdtmndtasgtdt0(X0,X1,X2) )
=> sdtmndtasgtdt0(X0,X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRTrans) ).
fof(f153,plain,
~ sdtmndtasgtdt0(sK12,xR,sK13(sK11(xR,sK12))),
inference(unit_resulting_resolution,[],[f112,f110,f150,f114,f148,f109]) ).
fof(f148,plain,
! [X0] : ~ aReductOfIn0(X0,sK13(sK11(xR,sK12)),xR),
inference(unit_resulting_resolution,[],[f110,f135,f142,f108]) ).
fof(f108,plain,
! [X2,X0,X1,X4] :
( ~ aNormalFormOfIn0(X2,X0,X1)
| ~ aReductOfIn0(X4,X2,X1)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f67]) ).
fof(f150,plain,
aElement0(sK13(sK11(xR,sK12))),
inference(unit_resulting_resolution,[],[f110,f135,f142,f106]) ).
fof(f106,plain,
! [X2,X0,X1] :
( ~ aNormalFormOfIn0(X2,X0,X1)
| aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f67]) ).
fof(f141,plain,
sdtmndtasgtdt0(sK12,xR,sK11(xR,sK12)),
inference(unit_resulting_resolution,[],[f112,f110,f135,f133,f81]) ).
fof(f81,plain,
! [X2,X0,X1] :
( sdtmndtasgtdt0(X0,X1,X2)
| ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COM013+1 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 10:09:22 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.61/0.79 % (949)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.61/0.79 % (948)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.61/0.79 % (940)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.61/0.79 % (943)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.79 % (945)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.61/0.79 % (942)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.61/0.79 % (946)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.61/0.79 % (947)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.61/0.80 % (945)Refutation not found, incomplete strategy% (945)------------------------------
% 0.61/0.80 % (945)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (945)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (945)Memory used [KB]: 1023
% 0.61/0.80 % (945)Time elapsed: 0.003 s
% 0.61/0.80 % (945)Instructions burned: 3 (million)
% 0.61/0.80 % (945)------------------------------
% 0.61/0.80 % (945)------------------------------
% 0.61/0.80 % (950)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.61/0.81 % (950)First to succeed.
% 0.61/0.81 % (950)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-939"
% 0.61/0.81 % (949)Instruction limit reached!
% 0.61/0.81 % (949)------------------------------
% 0.61/0.81 % (949)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (949)Termination reason: Unknown
% 0.61/0.81 % (949)Termination phase: Saturation
% 0.61/0.81
% 0.61/0.81 % (949)Memory used [KB]: 1153
% 0.61/0.81 % (949)Time elapsed: 0.016 s
% 0.61/0.81 % (949)Instructions burned: 57 (million)
% 0.61/0.81 % (949)------------------------------
% 0.61/0.81 % (949)------------------------------
% 0.61/0.81 % (950)Refutation found. Thanks to Tanya!
% 0.61/0.81 % SZS status Theorem for theBenchmark
% 0.61/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.81 % (950)------------------------------
% 0.61/0.81 % (950)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (950)Termination reason: Refutation
% 0.61/0.81
% 0.61/0.81 % (950)Memory used [KB]: 1135
% 0.61/0.81 % (950)Time elapsed: 0.009 s
% 0.61/0.81 % (950)Instructions burned: 11 (million)
% 0.61/0.81 % (939)Success in time 0.455 s
% 0.61/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------