TSTP Solution File: SYN354+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN354+1 : TPTP v8.2.0. 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 : n011.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 : Tue May 21 08:21:59 EDT 2024
% Result : Theorem 0.68s 0.87s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 180 ( 0 equ)
% Maximal formula atoms : 30 ( 8 avg)
% Number of connectives : 242 ( 84 ~; 82 |; 54 &)
% ( 6 <=>; 14 =>; 0 <=; 2 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 55 ( 34 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f38,plain,
$false,
inference(resolution,[],[f30,f10]) ).
fof(f10,plain,
big_f(sK0,sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X2,X3] :
( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,sK2(X2,X3))
| ~ big_g(X2,sK2(X2,X3)) )
& ( big_g(X2,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_g(X3,sK2(X2,X3))
| big_g(sK1,sK2(X2,X3)) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& big_g(X0,X1)
& big_f(X0,X1) )
=> ! [X3,X2] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(sK1,X4) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(sK1,X4) )
& ( big_g(X3,X4)
| big_g(sK1,X4) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2,X3] :
( ? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(sK1,X4) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(sK1,X4) )
& ( big_g(X3,X4)
| big_g(sK1,X4) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) )
=> ( ( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) )
& ( big_g(sK1,sK2(X2,X3))
| ~ big_g(X2,sK2(X2,X3)) )
& ( big_g(X2,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_f(sK1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK1,sK2(X2,X3)) )
& ( big_g(X3,sK2(X2,X3))
| big_g(sK1,sK2(X2,X3)) ) ) )
& big_g(sK0,sK1)
& big_f(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
<=> big_g(X2,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( big_g(X1,X4)
<~> big_g(X3,X4) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
<=> big_g(X2,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( big_g(X1,X4)
<~> big_g(X3,X4) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X1,X4)
<=> big_g(X3,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X2,X3)
& big_f(X1,X2)
& big_f(X0,X2) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X1,X4)
<=> big_g(X3,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X2,X3)
& big_f(X1,X2)
& big_f(X0,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_20_1) ).
fof(f30,plain,
! [X0] : ~ big_f(X0,sK1),
inference(subsumption_resolution,[],[f29,f24]) ).
fof(f24,plain,
! [X0] :
( ~ big_g(sK1,sK2(X0,sK1))
| ~ big_f(X0,sK1) ),
inference(subsumption_resolution,[],[f22,f18]) ).
fof(f18,plain,
~ big_f(sK1,sK1),
inference(subsumption_resolution,[],[f17,f10]) ).
fof(f17,plain,
( ~ big_f(sK1,sK1)
| ~ big_f(sK0,sK1) ),
inference(factoring,[],[f16]) ).
fof(f16,plain,
! [X2,X3] :
( ~ big_f(sK1,X2)
| ~ big_f(X2,X3)
| ~ big_f(sK0,X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f22,plain,
! [X0] :
( ~ big_g(sK1,sK2(X0,sK1))
| ~ big_f(X0,sK1)
| big_f(sK1,sK1) ),
inference(factoring,[],[f13]) ).
fof(f13,plain,
! [X2,X3] :
( ~ big_g(sK1,sK2(X2,X3))
| ~ big_f(X2,X3)
| ~ big_g(X3,sK2(X2,X3))
| big_f(sK1,X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f29,plain,
! [X0] :
( ~ big_f(X0,sK1)
| big_g(sK1,sK2(X0,sK1)) ),
inference(subsumption_resolution,[],[f28,f18]) ).
fof(f28,plain,
! [X0] :
( ~ big_f(X0,sK1)
| big_g(sK1,sK2(X0,sK1))
| big_f(sK1,sK1) ),
inference(duplicate_literal_removal,[],[f25]) ).
fof(f25,plain,
! [X0] :
( ~ big_f(X0,sK1)
| ~ big_f(X0,sK1)
| big_g(sK1,sK2(X0,sK1))
| big_f(sK1,sK1) ),
inference(resolution,[],[f24,f12]) ).
fof(f12,plain,
! [X2,X3] :
( big_g(sK1,sK2(X2,X3))
| ~ big_f(X2,X3)
| big_g(X3,sK2(X2,X3))
| big_f(sK1,X3) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN354+1 : TPTP v8.2.0. Released v2.0.0.
% 0.06/0.13 % 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 : n011.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 : Mon May 20 15:43:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_NEQ 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.68/0.86 % (12853)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.68/0.86 % (12850)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 (2994ds/34Mi)
% 0.68/0.86 % (12856)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 (2994ds/83Mi)
% 0.68/0.86 % (12852)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.68/0.86 % (12854)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 (2994ds/34Mi)
% 0.68/0.86 % (12855)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.68/0.86 % (12851)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 (2994ds/51Mi)
% 0.68/0.86 % (12857)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 (2994ds/56Mi)
% 0.68/0.87 % (12851)Also succeeded, but the first one will report.
% 0.68/0.87 % (12854)Also succeeded, but the first one will report.
% 0.68/0.87 % (12850)First to succeed.
% 0.68/0.87 % (12852)Also succeeded, but the first one will report.
% 0.68/0.87 % (12856)Also succeeded, but the first one will report.
% 0.68/0.87 % (12855)Also succeeded, but the first one will report.
% 0.68/0.87 % (12853)Also succeeded, but the first one will report.
% 0.68/0.87 % (12857)Also succeeded, but the first one will report.
% 0.68/0.87 % (12850)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12848"
% 0.68/0.87 % (12850)Refutation found. Thanks to Tanya!
% 0.68/0.87 % SZS status Theorem for theBenchmark
% 0.68/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 0.68/0.87 % (12850)------------------------------
% 0.68/0.87 % (12850)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.87 % (12850)Termination reason: Refutation
% 0.68/0.87
% 0.68/0.87 % (12850)Memory used [KB]: 990
% 0.68/0.87 % (12850)Time elapsed: 0.004 s
% 0.68/0.87 % (12850)Instructions burned: 4 (million)
% 0.68/0.87 % (12848)Success in time 0.515 s
% 0.68/0.87 % Vampire---4.8 exiting
%------------------------------------------------------------------------------