TSTP Solution File: SYN332+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN332+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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:33:59 EDT 2024
% Result : Theorem 0.54s 0.74s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of formulae : 32 ( 7 unt; 0 def)
% Number of atoms : 250 ( 0 equ)
% Maximal formula atoms : 60 ( 7 avg)
% Number of connectives : 326 ( 108 ~; 106 |; 77 &)
% ( 18 <=>; 11 =>; 0 <=; 6 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 63 ( 54 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f150,plain,
$false,
inference(subsumption_resolution,[],[f149,f146]) ).
fof(f146,plain,
! [X0,X1] : big_f(X0,X1),
inference(resolution,[],[f141,f10]) ).
fof(f10,plain,
! [X0,X1] :
( big_f(X0,sK0(X0,X1))
| big_f(X1,X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X1] :
( ( ~ big_f(sK0(X0,X1),X1)
| ( ( ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X1,X0)
| big_f(X0,X1) ) ) )
& ( big_f(sK0(X0,X1),X1)
| ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ~ big_f(X0,X1) ) ) )
& ( big_f(X0,X1)
| ~ big_f(X1,X0)
| ~ big_f(sK0(X0,X1),sK0(X0,X1)) )
& ( big_f(sK0(X0,X1),sK0(X0,X1))
| ( ~ big_f(X0,X1)
& big_f(X1,X0) ) )
& ( big_f(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) )
& ( big_f(X1,sK0(X0,X1))
| ~ big_f(X0,sK0(X0,X1)) )
& ( big_f(X0,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),X0) )
& ( big_f(sK0(X0,X1),X0)
| ~ big_f(X0,sK0(X0,X1)) )
& ( ~ big_f(X0,sK0(X0,X1))
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X0,sK0(X0,X1))
| ( big_f(X1,X0)
& big_f(X0,X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f7,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ big_f(X2,X1)
| ( ( ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X1,X0)
| big_f(X0,X1) ) ) )
& ( big_f(X2,X1)
| ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ~ big_f(X0,X1) ) ) )
& ( big_f(X0,X1)
| ~ big_f(X1,X0)
| ~ big_f(X2,X2) )
& ( big_f(X2,X2)
| ( ~ big_f(X0,X1)
& big_f(X1,X0) ) )
& ( big_f(X0,X2)
| ~ big_f(X1,X2) )
& ( big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_f(X0,X2)
| ~ big_f(X2,X0) )
& ( big_f(X2,X0)
| ~ big_f(X0,X2) )
& ( ~ big_f(X0,X2)
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X0,X2)
| ( big_f(X1,X0)
& big_f(X0,X1) ) ) )
=> ( ( ~ big_f(sK0(X0,X1),X1)
| ( ( ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X1,X0)
| big_f(X0,X1) ) ) )
& ( big_f(sK0(X0,X1),X1)
| ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ~ big_f(X0,X1) ) ) )
& ( big_f(X0,X1)
| ~ big_f(X1,X0)
| ~ big_f(sK0(X0,X1),sK0(X0,X1)) )
& ( big_f(sK0(X0,X1),sK0(X0,X1))
| ( ~ big_f(X0,X1)
& big_f(X1,X0) ) )
& ( big_f(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) )
& ( big_f(X1,sK0(X0,X1))
| ~ big_f(X0,sK0(X0,X1)) )
& ( big_f(X0,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),X0) )
& ( big_f(sK0(X0,X1),X0)
| ~ big_f(X0,sK0(X0,X1)) )
& ( ~ big_f(X0,sK0(X0,X1))
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X0,sK0(X0,X1))
| ( big_f(X1,X0)
& big_f(X0,X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X2,X1)
| ( ( ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X1,X0)
| big_f(X0,X1) ) ) )
& ( big_f(X2,X1)
| ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ~ big_f(X0,X1) ) ) )
& ( big_f(X0,X1)
| ~ big_f(X1,X0)
| ~ big_f(X2,X2) )
& ( big_f(X2,X2)
| ( ~ big_f(X0,X1)
& big_f(X1,X0) ) )
& ( big_f(X0,X2)
| ~ big_f(X1,X2) )
& ( big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_f(X0,X2)
| ~ big_f(X2,X0) )
& ( big_f(X2,X0)
| ~ big_f(X0,X2) )
& ( ~ big_f(X0,X2)
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X0,X2)
| ( big_f(X1,X0)
& big_f(X0,X1) ) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X2,X1)
| ( ( ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X1,X0)
| big_f(X0,X1) ) ) )
& ( big_f(X2,X1)
| ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ~ big_f(X0,X1) ) ) )
& ( big_f(X0,X1)
| ~ big_f(X1,X0)
| ~ big_f(X2,X2) )
& ( big_f(X2,X2)
| ( ~ big_f(X0,X1)
& big_f(X1,X0) ) )
& ( big_f(X0,X2)
| ~ big_f(X1,X2) )
& ( big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_f(X0,X2)
| ~ big_f(X2,X0) )
& ( big_f(X2,X0)
| ~ big_f(X0,X2) )
& ( ~ big_f(X0,X2)
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X0,X2)
| ( big_f(X1,X0)
& big_f(X0,X1) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
! [X0,X1] :
? [X2] :
( ( ( big_f(X0,X1)
<=> big_f(X1,X0) )
<~> big_f(X2,X1) )
& ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
<=> big_f(X2,X2) )
& ( big_f(X0,X2)
<=> big_f(X1,X2) )
& ( big_f(X0,X2)
<=> big_f(X2,X0) )
& ( ( big_f(X1,X0)
& big_f(X0,X1) )
<~> big_f(X0,X2) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
! [X0,X1] :
? [X2] :
( ( ( big_f(X0,X1)
<=> big_f(X1,X0) )
<~> big_f(X2,X1) )
& ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
<=> big_f(X2,X2) )
& ( big_f(X0,X2)
<=> big_f(X1,X2) )
& ( big_f(X0,X2)
<=> big_f(X2,X0) )
& ( ( big_f(X1,X0)
& big_f(X0,X1) )
<~> big_f(X0,X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
! [X2] :
( ( ( big_f(X1,X0)
& big_f(X0,X1) )
<~> big_f(X0,X2) )
=> ( ( big_f(X0,X2)
<=> big_f(X2,X0) )
=> ( ( big_f(X0,X2)
<=> big_f(X1,X2) )
=> ( ( ( big_f(X1,X0)
=> big_f(X0,X1) )
<=> big_f(X2,X2) )
=> ( ( big_f(X0,X1)
<=> big_f(X1,X0) )
<=> big_f(X2,X1) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X0,X1] :
! [X2] :
( ( ( big_f(X1,X0)
& big_f(X0,X1) )
<~> big_f(X0,X2) )
=> ( ( big_f(X0,X2)
<=> big_f(X2,X0) )
=> ( ( big_f(X0,X2)
<=> big_f(X1,X2) )
=> ( ( ( big_f(X1,X0)
=> big_f(X0,X1) )
<=> big_f(X2,X2) )
=> ( ( big_f(X0,X1)
<=> big_f(X1,X0) )
<=> big_f(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.amWYxKixiU/Vampire---4.8_7933',church_46_14_4) ).
fof(f141,plain,
! [X0,X1] : ~ big_f(X0,sK0(X0,X1)),
inference(resolution,[],[f133,f14]) ).
fof(f14,plain,
! [X0,X1] :
( big_f(X1,sK0(X0,X1))
| ~ big_f(X0,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f133,plain,
! [X0,X1] : ~ big_f(X1,sK0(X0,X1)),
inference(subsumption_resolution,[],[f128,f100]) ).
fof(f100,plain,
! [X0,X1] :
( ~ big_f(X0,sK0(X1,X0))
| big_f(X1,X0) ),
inference(subsumption_resolution,[],[f90,f67]) ).
fof(f67,plain,
! [X0,X1] :
( big_f(X1,X0)
| ~ big_f(X0,X1) ),
inference(resolution,[],[f62,f18]) ).
fof(f18,plain,
! [X0,X1] :
( ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,X0)
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f62,plain,
! [X0] : big_f(X0,X0),
inference(resolution,[],[f54,f10]) ).
fof(f54,plain,
! [X0] : ~ big_f(X0,sK0(X0,X0)),
inference(subsumption_resolution,[],[f53,f37]) ).
fof(f37,plain,
! [X0] :
( ~ big_f(X0,sK0(X0,X0))
| ~ big_f(X0,X0) ),
inference(duplicate_literal_removal,[],[f27]) ).
fof(f27,plain,
! [X0] :
( ~ big_f(X0,X0)
| ~ big_f(X0,X0)
| ~ big_f(X0,sK0(X0,X0)) ),
inference(resolution,[],[f11,f14]) ).
fof(f11,plain,
! [X0,X1] :
( ~ big_f(X0,sK0(X0,X1))
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f53,plain,
! [X0] :
( big_f(X0,X0)
| ~ big_f(X0,sK0(X0,X0)) ),
inference(duplicate_literal_removal,[],[f48]) ).
fof(f48,plain,
! [X0] :
( big_f(X0,X0)
| big_f(X0,X0)
| ~ big_f(X0,sK0(X0,X0)) ),
inference(resolution,[],[f21,f12]) ).
fof(f12,plain,
! [X0,X1] :
( big_f(sK0(X0,X1),X0)
| ~ big_f(X0,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f21,plain,
! [X0,X1] :
( ~ big_f(sK0(X0,X1),X1)
| big_f(X1,X0)
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f90,plain,
! [X0,X1] :
( ~ big_f(X0,sK0(X1,X0))
| big_f(X0,X1)
| big_f(X1,X0) ),
inference(resolution,[],[f67,f21]) ).
fof(f128,plain,
! [X0,X1] :
( ~ big_f(X0,X1)
| ~ big_f(X1,sK0(X0,X1)) ),
inference(resolution,[],[f98,f15]) ).
fof(f15,plain,
! [X0,X1] :
( big_f(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f98,plain,
! [X0,X1] :
( ~ big_f(X0,sK0(X0,X1))
| ~ big_f(X0,X1) ),
inference(duplicate_literal_removal,[],[f97]) ).
fof(f97,plain,
! [X0,X1] :
( ~ big_f(X0,X1)
| ~ big_f(X0,sK0(X0,X1))
| ~ big_f(X0,X1) ),
inference(resolution,[],[f67,f11]) ).
fof(f149,plain,
! [X0,X1] : ~ big_f(sK0(X0,X1),X0),
inference(resolution,[],[f141,f67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN332+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 17:46:45 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.amWYxKixiU/Vampire---4.8_7933
% 0.54/0.74 % (8144)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.54/0.74 % (8143)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.54/0.74 % (8136)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.54/0.74 % (8138)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.54/0.74 % (8139)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.54/0.74 % (8141)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.54/0.74 % (8137)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.54/0.74 % (8142)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.54/0.74 % (8144)First to succeed.
% 0.54/0.74 % (8141)Also succeeded, but the first one will report.
% 0.54/0.74 % (8144)Refutation found. Thanks to Tanya!
% 0.54/0.74 % SZS status Theorem for Vampire---4
% 0.54/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.74 % (8144)------------------------------
% 0.54/0.74 % (8144)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.74 % (8144)Termination reason: Refutation
% 0.54/0.74
% 0.54/0.74 % (8144)Memory used [KB]: 980
% 0.54/0.74 % (8144)Time elapsed: 0.003 s
% 0.54/0.74 % (8144)Instructions burned: 7 (million)
% 0.54/0.74 % (8144)------------------------------
% 0.54/0.74 % (8144)------------------------------
% 0.54/0.74 % (8123)Success in time 0.38 s
% 0.54/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------