TSTP Solution File: SYN349+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN349+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 : n032.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:59 EDT 2024
% Result : Theorem 0.45s 0.70s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 245 ( 0 equ)
% Maximal formula atoms : 52 ( 9 avg)
% Number of connectives : 330 ( 112 ~; 138 |; 64 &)
% ( 11 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 55 ( 41 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f79,plain,
$false,
inference(subsumption_resolution,[],[f78,f61]) ).
fof(f61,plain,
! [X0] : big_f(X0,sK1(X0,sK0(X0))),
inference(resolution,[],[f60,f10]) ).
fof(f10,plain,
! [X2,X0] :
( ~ big_f(sK0(X0),sK1(X0,X2))
| big_f(X0,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X2] :
( ( ~ big_f(sK1(X0,X2),sK0(X0))
| ( ( ~ big_f(X2,sK1(X0,X2))
| ( ( ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(sK1(X0,X2),X2)
| big_f(X0,sK1(X0,X2)) ) ) )
& ( big_f(X2,sK1(X0,X2))
| ( ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ) ) ) ) )
& ( big_f(sK1(X0,X2),sK0(X0))
| ( ( ( ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ) )
| ~ big_f(X2,sK1(X0,X2)) )
& ( big_f(X2,sK1(X0,X2))
| ( ( ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(sK1(X0,X2),X2)
| big_f(X0,sK1(X0,X2)) ) ) ) ) )
& ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK0(X0),sK1(X0,X2)) )
& ( big_f(sK0(X0),sK1(X0,X2))
| ~ big_f(X0,sK1(X0,X2)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f7,f6]) ).
fof(f6,plain,
! [X0] :
( ? [X1] :
! [X2] :
? [X3] :
( ( ~ big_f(X3,X1)
| ( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) )
& ( big_f(X2,X3)
| ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) ) ) ) )
& ( big_f(X3,X1)
| ( ( ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) )
| ~ big_f(X2,X3) )
& ( big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) ) ) )
& ( big_f(X0,X3)
| ~ big_f(X1,X3) )
& ( big_f(X1,X3)
| ~ big_f(X0,X3) ) )
=> ! [X2] :
? [X3] :
( ( ~ big_f(X3,sK0(X0))
| ( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) )
& ( big_f(X2,X3)
| ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) ) ) ) )
& ( big_f(X3,sK0(X0))
| ( ( ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) )
| ~ big_f(X2,X3) )
& ( big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) ) ) )
& ( big_f(X0,X3)
| ~ big_f(sK0(X0),X3) )
& ( big_f(sK0(X0),X3)
| ~ big_f(X0,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
! [X0,X2] :
( ? [X3] :
( ( ~ big_f(X3,sK0(X0))
| ( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) )
& ( big_f(X2,X3)
| ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) ) ) ) )
& ( big_f(X3,sK0(X0))
| ( ( ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) )
| ~ big_f(X2,X3) )
& ( big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) ) ) )
& ( big_f(X0,X3)
| ~ big_f(sK0(X0),X3) )
& ( big_f(sK0(X0),X3)
| ~ big_f(X0,X3) ) )
=> ( ( ~ big_f(sK1(X0,X2),sK0(X0))
| ( ( ~ big_f(X2,sK1(X0,X2))
| ( ( ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(sK1(X0,X2),X2)
| big_f(X0,sK1(X0,X2)) ) ) )
& ( big_f(X2,sK1(X0,X2))
| ( ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ) ) ) ) )
& ( big_f(sK1(X0,X2),sK0(X0))
| ( ( ( ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ) )
| ~ big_f(X2,sK1(X0,X2)) )
& ( big_f(X2,sK1(X0,X2))
| ( ( ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(sK1(X0,X2),X2)
| big_f(X0,sK1(X0,X2)) ) ) ) ) )
& ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK0(X0),sK1(X0,X2)) )
& ( big_f(sK0(X0),sK1(X0,X2))
| ~ big_f(X0,sK1(X0,X2)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ~ big_f(X3,X1)
| ( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) )
& ( big_f(X2,X3)
| ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) ) ) ) )
& ( big_f(X3,X1)
| ( ( ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) )
| ~ big_f(X2,X3) )
& ( big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) ) ) )
& ( big_f(X0,X3)
| ~ big_f(X1,X3) )
& ( big_f(X1,X3)
| ~ big_f(X0,X3) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ~ big_f(X3,X1)
| ( ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) )
& ( big_f(X2,X3)
| ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) ) ) ) )
& ( big_f(X3,X1)
| ( ( ( ( big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| ~ big_f(X0,X3) ) )
| ~ big_f(X2,X3) )
& ( big_f(X2,X3)
| ( ( ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X3,X2)
| big_f(X0,X3) ) ) ) ) )
& ( big_f(X0,X3)
| ~ big_f(X1,X3) )
& ( big_f(X1,X3)
| ~ big_f(X0,X3) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ( ( big_f(X0,X3)
<=> big_f(X3,X2) )
<=> big_f(X2,X3) )
<~> big_f(X3,X1) )
& ( big_f(X0,X3)
<=> big_f(X1,X3) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X0] :
! [X1] :
? [X2] :
! [X3] :
( ( big_f(X0,X3)
<=> big_f(X1,X3) )
=> ( ( ( big_f(X0,X3)
<=> big_f(X3,X2) )
<=> big_f(X2,X3) )
<=> big_f(X3,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X0] :
! [X1] :
? [X2] :
! [X3] :
( ( big_f(X0,X3)
<=> big_f(X1,X3) )
=> ( ( ( big_f(X0,X3)
<=> big_f(X3,X2) )
<=> big_f(X2,X3) )
<=> big_f(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jbMeDQfM0P/Vampire---4.8_7717',church_46_17_5) ).
fof(f60,plain,
! [X0] : big_f(sK0(X0),sK1(X0,sK0(X0))),
inference(subsumption_resolution,[],[f59,f9]) ).
fof(f9,plain,
! [X2,X0] :
( big_f(sK0(X0),sK1(X0,X2))
| ~ big_f(X0,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f59,plain,
! [X0] :
( big_f(sK0(X0),sK1(X0,sK0(X0)))
| big_f(X0,sK1(X0,sK0(X0))) ),
inference(subsumption_resolution,[],[f55,f32]) ).
fof(f32,plain,
! [X0] : big_f(sK1(X0,sK0(X0)),sK0(X0)),
inference(subsumption_resolution,[],[f31,f21]) ).
fof(f21,plain,
! [X0] :
( big_f(sK1(X0,sK0(X0)),sK0(X0))
| big_f(sK0(X0),sK1(X0,sK0(X0))) ),
inference(subsumption_resolution,[],[f20,f9]) ).
fof(f20,plain,
! [X0] :
( big_f(sK1(X0,sK0(X0)),sK0(X0))
| big_f(sK0(X0),sK1(X0,sK0(X0)))
| big_f(X0,sK1(X0,sK0(X0))) ),
inference(factoring,[],[f11]) ).
fof(f11,plain,
! [X2,X0] :
( big_f(sK1(X0,X2),sK0(X0))
| big_f(sK1(X0,X2),X2)
| big_f(X2,sK1(X0,X2))
| big_f(X0,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f31,plain,
! [X0] :
( big_f(sK1(X0,sK0(X0)),sK0(X0))
| ~ big_f(sK0(X0),sK1(X0,sK0(X0))) ),
inference(subsumption_resolution,[],[f29,f10]) ).
fof(f29,plain,
! [X0] :
( big_f(sK1(X0,sK0(X0)),sK0(X0))
| ~ big_f(X0,sK1(X0,sK0(X0)))
| ~ big_f(sK0(X0),sK1(X0,sK0(X0))) ),
inference(factoring,[],[f13]) ).
fof(f13,plain,
! [X2,X0] :
( big_f(sK1(X0,X2),sK0(X0))
| big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2))
| ~ big_f(X2,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f55,plain,
! [X0] :
( big_f(sK0(X0),sK1(X0,sK0(X0)))
| big_f(X0,sK1(X0,sK0(X0)))
| ~ big_f(sK1(X0,sK0(X0)),sK0(X0)) ),
inference(resolution,[],[f16,f32]) ).
fof(f16,plain,
! [X2,X0] :
( ~ big_f(sK1(X0,X2),sK0(X0))
| big_f(X2,sK1(X0,X2))
| big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f78,plain,
! [X0] : ~ big_f(X0,sK1(X0,sK0(X0))),
inference(subsumption_resolution,[],[f77,f32]) ).
fof(f77,plain,
! [X0] :
( ~ big_f(sK1(X0,sK0(X0)),sK0(X0))
| ~ big_f(X0,sK1(X0,sK0(X0))) ),
inference(subsumption_resolution,[],[f74,f60]) ).
fof(f74,plain,
! [X0] :
( ~ big_f(sK0(X0),sK1(X0,sK0(X0)))
| ~ big_f(sK1(X0,sK0(X0)),sK0(X0))
| ~ big_f(X0,sK1(X0,sK0(X0))) ),
inference(resolution,[],[f18,f32]) ).
fof(f18,plain,
! [X2,X0] :
( ~ big_f(sK1(X0,X2),sK0(X0))
| ~ big_f(X2,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN349+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.14 % 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.11/0.34 % Computer : n032.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Fri May 3 17:21:23 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.11/0.34 This is a FOF_THM_RFO_NEQ problem
% 0.11/0.34 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.jbMeDQfM0P/Vampire---4.8_7717
% 0.45/0.70 % (7830)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.45/0.70 % (7827)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.45/0.70 % (7832)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.45/0.70 % (7833)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.45/0.70 % (7831)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.45/0.70 % (7829)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.45/0.70 % (7830)First to succeed.
% 0.45/0.70 % (7833)Also succeeded, but the first one will report.
% 0.45/0.70 % (7831)Also succeeded, but the first one will report.
% 0.45/0.70 % (7830)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-7825"
% 0.45/0.70 % (7829)Refutation not found, incomplete strategy% (7829)------------------------------
% 0.45/0.70 % (7829)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.45/0.70 % (7829)Termination reason: Refutation not found, incomplete strategy
% 0.45/0.70
% 0.45/0.70 % (7829)Memory used [KB]: 969
% 0.45/0.70 % (7829)Time elapsed: 0.002 s
% 0.45/0.70 % (7829)Instructions burned: 3 (million)
% 0.45/0.70 % (7828)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.45/0.70 % (7832)Also succeeded, but the first one will report.
% 0.45/0.70 % (7829)------------------------------
% 0.45/0.70 % (7829)------------------------------
% 0.45/0.70 % (7830)Refutation found. Thanks to Tanya!
% 0.45/0.70 % SZS status Theorem for Vampire---4
% 0.45/0.70 % SZS output start Proof for Vampire---4
% See solution above
% 0.45/0.70 % (7830)------------------------------
% 0.45/0.70 % (7830)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.45/0.70 % (7830)Termination reason: Refutation
% 0.45/0.70
% 0.45/0.70 % (7830)Memory used [KB]: 978
% 0.45/0.70 % (7830)Time elapsed: 0.003 s
% 0.45/0.70 % (7830)Instructions burned: 5 (million)
% 0.45/0.70 % (7825)Success in time 0.351 s
% 0.45/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------