TSTP Solution File: SYN333+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN333+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 : 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 11:56:53 EDT 2024
% Result : Theorem 0.69s 0.84s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 104 ( 45 ~; 31 |; 23 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 37 ( 30 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18,plain,
$false,
inference(subsumption_resolution,[],[f17,f7]) ).
fof(f7,plain,
! [X0,X1] : big_f(X0,X1),
inference(cnf_transformation,[],[f6]) ).
fof(f6,plain,
! [X0,X1] :
( ( ( ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,sK0(X0,X1)) )
& big_g(X0,X1)
& big_f(X0,X1) )
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) )
& big_f(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f4,f5]) ).
fof(f5,plain,
! [X0,X1] :
( ? [X2] :
( ( ( ( ~ big_g(X2,X2)
| ~ big_g(X0,X2) )
& big_g(X0,X1)
& big_f(X0,X1) )
| ~ big_f(X2,X2)
| ~ big_f(X1,X2) )
& big_f(X0,X1) )
=> ( ( ( ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,sK0(X0,X1)) )
& big_g(X0,X1)
& big_f(X0,X1) )
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) )
& big_f(X0,X1) ) ),
introduced(choice_axiom,[]) ).
fof(f4,plain,
! [X0,X1] :
? [X2] :
( ( ( ( ~ big_g(X2,X2)
| ~ big_g(X0,X2) )
& big_g(X0,X1)
& big_f(X0,X1) )
| ~ big_f(X2,X2)
| ~ big_f(X1,X2) )
& big_f(X0,X1) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
! [X0,X1] :
? [X2] :
( ( ( ( ~ big_g(X2,X2)
| ~ big_g(X0,X2) )
& big_g(X0,X1)
& big_f(X0,X1) )
| ~ big_f(X2,X2)
| ~ big_f(X1,X2) )
& big_f(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
! [X2] :
( big_f(X0,X1)
=> ( ( ( big_g(X0,X1)
& big_f(X0,X1) )
=> ( big_g(X2,X2)
& big_g(X0,X2) ) )
& big_f(X2,X2)
& big_f(X1,X2) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X0,X1] :
! [X2] :
( big_f(X0,X1)
=> ( ( ( big_g(X0,X1)
& big_f(X0,X1) )
=> ( big_g(X2,X2)
& big_g(X0,X2) ) )
& big_f(X2,X2)
& big_f(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.kFb8ATFVC9/Vampire---4.8_20158',church_46_14_5) ).
fof(f17,plain,
! [X0,X1] : ~ big_f(sK0(X0,X1),sK0(X0,sK0(X0,X1))),
inference(subsumption_resolution,[],[f16,f7]) ).
fof(f16,plain,
! [X0,X1] :
( ~ big_f(sK0(X0,sK0(X0,X1)),sK0(X0,sK0(X0,X1)))
| ~ big_f(sK0(X0,X1),sK0(X0,sK0(X0,X1))) ),
inference(resolution,[],[f15,f9]) ).
fof(f9,plain,
! [X0,X1] :
( big_g(X0,X1)
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
fof(f15,plain,
! [X0,X1] : ~ big_g(X0,sK0(X0,X1)),
inference(subsumption_resolution,[],[f14,f7]) ).
fof(f14,plain,
! [X0,X1] :
( ~ big_g(X0,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(sK0(X0,X1),sK0(X0,X1))) ),
inference(subsumption_resolution,[],[f13,f7]) ).
fof(f13,plain,
! [X0,X1] :
( ~ big_g(X0,sK0(X0,X1))
| ~ big_f(sK0(sK0(X0,X1),sK0(X0,X1)),sK0(sK0(X0,X1),sK0(X0,X1)))
| ~ big_f(sK0(X0,X1),sK0(sK0(X0,X1),sK0(X0,X1))) ),
inference(subsumption_resolution,[],[f12,f7]) ).
fof(f12,plain,
! [X0,X1] :
( ~ big_g(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1))
| ~ big_f(sK0(sK0(X0,X1),sK0(X0,X1)),sK0(sK0(X0,X1),sK0(X0,X1)))
| ~ big_f(sK0(X0,X1),sK0(sK0(X0,X1),sK0(X0,X1))) ),
inference(subsumption_resolution,[],[f11,f7]) ).
fof(f11,plain,
! [X0,X1] :
( ~ big_g(X0,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1))
| ~ big_f(sK0(sK0(X0,X1),sK0(X0,X1)),sK0(sK0(X0,X1),sK0(X0,X1)))
| ~ big_f(sK0(X0,X1),sK0(sK0(X0,X1),sK0(X0,X1))) ),
inference(resolution,[],[f10,f9]) ).
fof(f10,plain,
! [X0,X1] :
( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN333+1 : TPTP v8.1.2. Released v2.0.0.
% 0.15/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 17:18:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_EPR_NEQ problem
% 0.15/0.36 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.kFb8ATFVC9/Vampire---4.8_20158
% 0.69/0.84 % (20544)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.69/0.84 % (20544)First to succeed.
% 0.69/0.84 % (20546)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.69/0.84 % (20547)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.69/0.84 % (20548)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.69/0.84 % (20549)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.69/0.84 % (20542)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.69/0.84 % (20544)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20413"
% 0.69/0.84 % (20543)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.69/0.84 % (20547)Also succeeded, but the first one will report.
% 0.69/0.84 % (20548)Also succeeded, but the first one will report.
% 0.69/0.84 % (20546)Also succeeded, but the first one will report.
% 0.69/0.84 % (20549)Also succeeded, but the first one will report.
% 0.69/0.84 % (20544)Refutation found. Thanks to Tanya!
% 0.69/0.84 % SZS status Theorem for Vampire---4
% 0.69/0.84 % SZS output start Proof for Vampire---4
% See solution above
% 0.69/0.84 % (20544)------------------------------
% 0.69/0.84 % (20544)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.69/0.84 % (20544)Termination reason: Refutation
% 0.69/0.84
% 0.69/0.84 % (20544)Memory used [KB]: 960
% 0.69/0.84 % (20544)Time elapsed: 0.002 s
% 0.69/0.84 % (20544)Instructions burned: 3 (million)
% 0.69/0.84 % (20413)Success in time 0.47 s
% 0.69/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------