TSTP Solution File: SYN365+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN365+1 : TPTP v8.1.2. Released v2.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 : n016.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 : Wed May 1 04:34:09 EDT 2024
% Result : Theorem 0.60s 0.75s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 108 ( 36 ~; 22 |; 36 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 43 ( 29 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,plain,
$false,
inference(subsumption_resolution,[],[f20,f14]) ).
fof(f14,plain,
big_p(sK0),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ! [X1] :
( ~ big_p(X1)
| ~ big_r(sK0,X1) )
& big_p(sK0)
& ! [X2] :
( ( big_p(h(X2))
& big_p(g(X2)) )
| ~ big_p(X2) )
& ! [X3] :
( ( big_p(sK1(X3))
& big_r(X3,g(h(sK1(X3)))) )
| ~ big_p(X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0] :
( ! [X1] :
( ~ big_p(X1)
| ~ big_r(X0,X1) )
& big_p(X0) )
=> ( ! [X1] :
( ~ big_p(X1)
| ~ big_r(sK0,X1) )
& big_p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X3] :
( ? [X4] :
( ( big_p(X4)
& big_r(X3,g(h(X4))) )
| ~ big_p(X3) )
=> ( ( big_p(sK1(X3))
& big_r(X3,g(h(sK1(X3)))) )
| ~ big_p(X3) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ? [X0] :
( ! [X1] :
( ~ big_p(X1)
| ~ big_r(X0,X1) )
& big_p(X0) )
& ! [X2] :
( ( big_p(h(X2))
& big_p(g(X2)) )
| ~ big_p(X2) )
& ! [X3] :
? [X4] :
( ( big_p(X4)
& big_r(X3,g(h(X4))) )
| ~ big_p(X3) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ? [X3] :
( ! [X4] :
( ~ big_p(X4)
| ~ big_r(X3,X4) )
& big_p(X3) )
& ! [X0] :
( ( big_p(h(X0))
& big_p(g(X0)) )
| ~ big_p(X0) )
& ! [X1] :
? [X2] :
( ( big_p(X2)
& big_r(X1,g(h(X2))) )
| ~ big_p(X1) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X3] :
( ! [X4] :
( ~ big_p(X4)
| ~ big_r(X3,X4) )
& big_p(X3) )
& ! [X0] :
( ( big_p(h(X0))
& big_p(g(X0)) )
| ~ big_p(X0) )
& ! [X1] :
? [X2] :
( ( big_p(X2)
& big_r(X1,g(h(X2))) )
| ~ big_p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ! [X0] :
( big_p(X0)
=> ( big_p(h(X0))
& big_p(g(X0)) ) )
& ! [X1] :
? [X2] :
( big_p(X1)
=> ( big_p(X2)
& big_r(X1,g(h(X2))) ) ) )
=> ! [X3] :
( big_p(X3)
=> ? [X4] :
( big_p(X4)
& big_r(X3,X4) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ! [X2] :
( big_p(X2)
=> ( big_p(h(X2))
& big_p(g(X2)) ) )
& ! [X0] :
? [X1] :
( big_p(X0)
=> ( big_p(X1)
& big_r(X0,g(h(X1))) ) ) )
=> ! [X0] :
( big_p(X0)
=> ? [X1] :
( big_p(X1)
& big_r(X0,X1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ! [X2] :
( big_p(X2)
=> ( big_p(h(X2))
& big_p(g(X2)) ) )
& ! [X0] :
? [X1] :
( big_p(X0)
=> ( big_p(X1)
& big_r(X0,g(h(X1))) ) ) )
=> ! [X0] :
( big_p(X0)
=> ? [X1] :
( big_p(X1)
& big_r(X0,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Qsz2QVKbrT/Vampire---4.8_3068',x2116) ).
fof(f20,plain,
~ big_p(sK0),
inference(resolution,[],[f19,f11]) ).
fof(f11,plain,
! [X3] :
( big_p(sK1(X3))
| ~ big_p(X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f19,plain,
~ big_p(sK1(sK0)),
inference(resolution,[],[f18,f13]) ).
fof(f13,plain,
! [X2] :
( big_p(h(X2))
| ~ big_p(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
~ big_p(h(sK1(sK0))),
inference(resolution,[],[f17,f12]) ).
fof(f12,plain,
! [X2] :
( big_p(g(X2))
| ~ big_p(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
~ big_p(g(h(sK1(sK0)))),
inference(subsumption_resolution,[],[f16,f14]) ).
fof(f16,plain,
( ~ big_p(sK0)
| ~ big_p(g(h(sK1(sK0)))) ),
inference(resolution,[],[f10,f15]) ).
fof(f15,plain,
! [X1] :
( ~ big_r(sK0,X1)
| ~ big_p(X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f10,plain,
! [X3] :
( big_r(X3,g(h(sK1(X3))))
| ~ big_p(X3) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SYN365+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.16 % 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.16/0.37 % Computer : n016.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 17:59:26 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_NEQ problem
% 0.16/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.Qsz2QVKbrT/Vampire---4.8_3068
% 0.60/0.75 % (3336)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 (2996ds/56Mi)
% 0.60/0.75 % (3336)First to succeed.
% 0.60/0.75 % (3329)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 (2996ds/34Mi)
% 0.60/0.75 % (3331)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.60/0.75 % (3332)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.60/0.75 % (3330)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 (2996ds/51Mi)
% 0.60/0.75 % (3334)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.60/0.75 % (3333)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 (2996ds/34Mi)
% 0.60/0.75 % (3335)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 (2996ds/83Mi)
% 0.60/0.75 % (3336)Refutation found. Thanks to Tanya!
% 0.60/0.75 % SZS status Theorem for Vampire---4
% 0.60/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.75 % (3336)------------------------------
% 0.60/0.75 % (3336)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.75 % (3336)Termination reason: Refutation
% 0.60/0.75
% 0.60/0.75 % (3336)Memory used [KB]: 971
% 0.60/0.75 % (3336)Time elapsed: 0.002 s
% 0.60/0.75 % (3336)Instructions burned: 3 (million)
% 0.60/0.75 % (3336)------------------------------
% 0.60/0.75 % (3336)------------------------------
% 0.60/0.75 % (3325)Success in time 0.376 s
% 0.60/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------