TSTP Solution File: NUM341+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM341+1 : TPTP v8.1.2. Released v3.1.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 : n002.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 : Sun May 5 08:09:23 EDT 2024
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 3 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 46 ( 19 ~; 15 |; 8 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 45 ( 39 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f427,plain,
$false,
inference(subsumption_resolution,[],[f426,f424]) ).
fof(f424,plain,
! [X2,X0,X1] : sum(X0,X1,X2),
inference(subsumption_resolution,[],[f415,f420]) ).
fof(f420,plain,
! [X2,X0,X1] :
( ~ difference(X0,X1,X2)
| sum(X1,X2,X0) ),
inference(cnf_transformation,[],[f413]) ).
fof(f413,plain,
! [X0,X1,X2] :
( ( sum(X1,X2,X0)
| ~ difference(X0,X1,X2) )
& ( difference(X0,X1,X2)
| ~ sum(X1,X2,X0) ) ),
inference(nnf_transformation,[],[f296]) ).
fof(f296,axiom,
! [X0,X1,X2] :
( sum(X1,X2,X0)
<=> difference(X0,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.T4LA3ow6db/Vampire---4.8_14979',minus_entry_point) ).
fof(f415,plain,
! [X2,X0,X1] :
( difference(X2,X0,X1)
| sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f412]) ).
fof(f412,plain,
! [X0,X1,X2] :
( ( ~ difference(X2,X0,X1)
| ~ difference(X2,X1,X0)
| ~ sum(X0,X1,X2) )
& ( ( difference(X2,X0,X1)
& difference(X2,X1,X0) )
| sum(X0,X1,X2) ) ),
inference(flattening,[],[f411]) ).
fof(f411,plain,
! [X0,X1,X2] :
( ( ~ difference(X2,X0,X1)
| ~ difference(X2,X1,X0)
| ~ sum(X0,X1,X2) )
& ( ( difference(X2,X0,X1)
& difference(X2,X1,X0) )
| sum(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f406]) ).
fof(f406,plain,
! [X0,X1,X2] :
( sum(X0,X1,X2)
<~> ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) ),
inference(ennf_transformation,[],[f403]) ).
fof(f403,negated_conjecture,
~ ? [X0,X1,X2] :
( sum(X0,X1,X2)
<=> ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) ),
inference(negated_conjecture,[],[f402]) ).
fof(f402,conjecture,
? [X0,X1,X2] :
( sum(X0,X1,X2)
<=> ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.T4LA3ow6db/Vampire---4.8_14979',add_same_as_subtract) ).
fof(f426,plain,
! [X2,X0,X1] : ~ sum(X1,X0,X2),
inference(subsumption_resolution,[],[f425,f424]) ).
fof(f425,plain,
! [X2,X0,X1] :
( ~ sum(X0,X1,X2)
| ~ sum(X1,X0,X2) ),
inference(resolution,[],[f423,f419]) ).
fof(f419,plain,
! [X2,X0,X1] :
( difference(X0,X1,X2)
| ~ sum(X1,X2,X0) ),
inference(cnf_transformation,[],[f413]) ).
fof(f423,plain,
! [X2,X0,X1] :
( ~ difference(X2,X1,X0)
| ~ sum(X0,X1,X2) ),
inference(subsumption_resolution,[],[f416,f419]) ).
fof(f416,plain,
! [X2,X0,X1] :
( ~ difference(X2,X0,X1)
| ~ difference(X2,X1,X0)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f412]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM341+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.15 % 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.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 15:21:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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/tmp/tmp.T4LA3ow6db/Vampire---4.8_14979
% 0.61/0.79 % (15332)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.80 % (15325)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 Vampire---4 for (2995ds/34Mi)
% 0.61/0.80 % (15327)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.80 % (15326)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 Vampire---4 for (2995ds/51Mi)
% 0.61/0.80 % (15328)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.80 % (15329)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 Vampire---4 for (2995ds/34Mi)
% 0.61/0.80 % (15330)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.80 % (15331)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 Vampire---4 for (2995ds/83Mi)
% 0.61/0.80 % (15332)First to succeed.
% 0.61/0.80 % (15332)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15207"
% 0.61/0.80 % (15332)Refutation found. Thanks to Tanya!
% 0.61/0.80 % SZS status Theorem for Vampire---4
% 0.61/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.80 % (15332)------------------------------
% 0.61/0.80 % (15332)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (15332)Termination reason: Refutation
% 0.61/0.80
% 0.61/0.80 % (15332)Memory used [KB]: 1282
% 0.61/0.80 % (15332)Time elapsed: 0.003 s
% 0.61/0.80 % (15332)Instructions burned: 4 (million)
% 0.61/0.80 % (15207)Success in time 0.424 s
% 0.61/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------