TSTP Solution File: SYN075+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN075+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 : n004.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:12 EDT 2024
% Result : Theorem 0.66s 0.88s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 7 unt; 0 def)
% Number of atoms : 163 ( 95 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 199 ( 76 ~; 80 |; 30 &)
% ( 8 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 90 ( 61 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f85,plain,
$false,
inference(subsumption_resolution,[],[f84,f25]) ).
fof(f25,plain,
big_f(sK3,sK4),
inference(equality_resolution,[],[f24]) ).
fof(f24,plain,
! [X2] :
( big_f(X2,sK4)
| sK3 != X2 ),
inference(equality_resolution,[],[f22]) ).
fof(f22,plain,
! [X2,X3] :
( big_f(X2,X3)
| sK4 != X3
| sK3 != X2 ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X2,X3] :
( ( big_f(X2,X3)
| sK4 != X3
| sK3 != X2 )
& ( ( sK4 = X3
& sK3 = X2 )
| ~ big_f(X2,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f13,f14]) ).
fof(f14,plain,
( ? [X0,X1] :
! [X2,X3] :
( ( big_f(X2,X3)
| X1 != X3
| X0 != X2 )
& ( ( X1 = X3
& X0 = X2 )
| ~ big_f(X2,X3) ) )
=> ! [X3,X2] :
( ( big_f(X2,X3)
| sK4 != X3
| sK3 != X2 )
& ( ( sK4 = X3
& sK3 = X2 )
| ~ big_f(X2,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
? [X0,X1] :
! [X2,X3] :
( ( big_f(X2,X3)
| X1 != X3
| X0 != X2 )
& ( ( X1 = X3
& X0 = X2 )
| ~ big_f(X2,X3) ) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
? [X0,X1] :
! [X2,X3] :
( ( big_f(X2,X3)
| X1 != X3
| X0 != X2 )
& ( ( X1 = X3
& X0 = X2 )
| ~ big_f(X2,X3) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
? [X0,X1] :
! [X2,X3] :
( big_f(X2,X3)
<=> ( X1 = X3
& X0 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.ui0BTxqR0I/Vampire---4.8_425',pel52_1) ).
fof(f84,plain,
~ big_f(sK3,sK4),
inference(forward_demodulation,[],[f83,f39]) ).
fof(f39,plain,
sK4 = sK0(sK4),
inference(equality_resolution,[],[f38]) ).
fof(f38,plain,
! [X0] :
( sK4 != X0
| sK0(X0) = X0 ),
inference(equality_factoring,[],[f32]) ).
fof(f32,plain,
! [X0] :
( sK0(X0) = sK4
| sK0(X0) = X0 ),
inference(resolution,[],[f21,f23]) ).
fof(f23,plain,
! [X0] :
( big_f(sK2(X0),sK0(X0))
| sK0(X0) = X0 ),
inference(equality_resolution,[],[f17]) ).
fof(f17,plain,
! [X0,X5] :
( sK0(X0) = X0
| big_f(X5,sK0(X0))
| sK2(X0) != X5 ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0] :
( ( sK0(X0) != X0
| ! [X2] :
( ( sK1(X0,X2) != X2
| ~ big_f(sK1(X0,X2),sK0(X0)) )
& ( sK1(X0,X2) = X2
| big_f(sK1(X0,X2),sK0(X0)) ) ) )
& ( sK0(X0) = X0
| ! [X5] :
( ( big_f(X5,sK0(X0))
| sK2(X0) != X5 )
& ( sK2(X0) = X5
| ~ big_f(X5,sK0(X0)) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).
fof(f8,plain,
! [X0] :
( ? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) ) )
& ( X0 = X1
| ? [X4] :
! [X5] :
( ( big_f(X5,X1)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,X1) ) ) ) )
=> ( ( sK0(X0) != X0
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,sK0(X0)) )
& ( X2 = X3
| big_f(X3,sK0(X0)) ) ) )
& ( sK0(X0) = X0
| ? [X4] :
! [X5] :
( ( big_f(X5,sK0(X0))
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,sK0(X0)) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X0,X2] :
( ? [X3] :
( ( X2 != X3
| ~ big_f(X3,sK0(X0)) )
& ( X2 = X3
| big_f(X3,sK0(X0)) ) )
=> ( ( sK1(X0,X2) != X2
| ~ big_f(sK1(X0,X2),sK0(X0)) )
& ( sK1(X0,X2) = X2
| big_f(sK1(X0,X2),sK0(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
! [X0] :
( ? [X4] :
! [X5] :
( ( big_f(X5,sK0(X0))
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,sK0(X0)) ) )
=> ! [X5] :
( ( big_f(X5,sK0(X0))
| sK2(X0) != X5 )
& ( sK2(X0) = X5
| ~ big_f(X5,sK0(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
! [X0] :
? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) ) )
& ( X0 = X1
| ? [X4] :
! [X5] :
( ( big_f(X5,X1)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,X1) ) ) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
! [X0] :
? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) ) )
& ( X0 = X1
| ? [X2] :
! [X3] :
( ( big_f(X3,X1)
| X2 != X3 )
& ( X2 = X3
| ~ big_f(X3,X1) ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
! [X0] :
? [X1] :
( ? [X2] :
! [X3] :
( big_f(X3,X1)
<=> X2 = X3 )
<~> X0 = X1 ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,plain,
~ ? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( big_f(X3,X1)
<=> X2 = X3 )
<=> X0 = X1 ),
inference(rectify,[],[f3]) ).
fof(f3,negated_conjecture,
~ ? [X1] :
! [X3] :
( ? [X0] :
! [X2] :
( big_f(X2,X3)
<=> X0 = X2 )
<=> X1 = X3 ),
inference(negated_conjecture,[],[f2]) ).
fof(f2,conjecture,
? [X1] :
! [X3] :
( ? [X0] :
! [X2] :
( big_f(X2,X3)
<=> X0 = X2 )
<=> X1 = X3 ),
file('/export/starexec/sandbox2/tmp/tmp.ui0BTxqR0I/Vampire---4.8_425',pel52) ).
fof(f21,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| sK4 = X3 ),
inference(cnf_transformation,[],[f15]) ).
fof(f83,plain,
~ big_f(sK3,sK0(sK4)),
inference(subsumption_resolution,[],[f81,f39]) ).
fof(f81,plain,
( ~ big_f(sK3,sK0(sK4))
| sK4 != sK0(sK4) ),
inference(trivial_inequality_removal,[],[f80]) ).
fof(f80,plain,
( ~ big_f(sK3,sK0(sK4))
| sK3 != sK3
| sK4 != sK0(sK4) ),
inference(superposition,[],[f19,f70]) ).
fof(f70,plain,
sK3 = sK1(sK4,sK3),
inference(resolution,[],[f61,f20]) ).
fof(f20,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| sK3 = X2 ),
inference(cnf_transformation,[],[f15]) ).
fof(f61,plain,
big_f(sK1(sK4,sK3),sK4),
inference(resolution,[],[f55,f25]) ).
fof(f55,plain,
! [X0] :
( ~ big_f(X0,sK4)
| big_f(sK1(sK4,X0),sK4) ),
inference(forward_demodulation,[],[f54,f39]) ).
fof(f54,plain,
! [X0] :
( ~ big_f(X0,sK0(sK4))
| big_f(sK1(sK4,X0),sK4) ),
inference(subsumption_resolution,[],[f53,f39]) ).
fof(f53,plain,
! [X0] :
( ~ big_f(X0,sK0(sK4))
| sK4 != sK0(sK4)
| big_f(sK1(sK4,X0),sK4) ),
inference(trivial_inequality_removal,[],[f52]) ).
fof(f52,plain,
! [X0] :
( ~ big_f(X0,sK0(sK4))
| X0 != X0
| sK4 != sK0(sK4)
| big_f(sK1(sK4,X0),sK4) ),
inference(superposition,[],[f19,f44]) ).
fof(f44,plain,
! [X0] :
( sK1(sK4,X0) = X0
| big_f(sK1(sK4,X0),sK4) ),
inference(trivial_inequality_removal,[],[f41]) ).
fof(f41,plain,
! [X0] :
( sK4 != sK4
| sK1(sK4,X0) = X0
| big_f(sK1(sK4,X0),sK4) ),
inference(superposition,[],[f18,f39]) ).
fof(f18,plain,
! [X2,X0] :
( sK0(X0) != X0
| sK1(X0,X2) = X2
| big_f(sK1(X0,X2),sK0(X0)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f19,plain,
! [X2,X0] :
( ~ big_f(sK1(X0,X2),sK0(X0))
| sK1(X0,X2) != X2
| sK0(X0) != X0 ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN075+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/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.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 17:20:33 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/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.ui0BTxqR0I/Vampire---4.8_425
% 0.66/0.88 % (685)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.66/0.88 % (683)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 (2994ds/34Mi)
% 0.66/0.88 % (686)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.66/0.88 % (684)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 (2994ds/51Mi)
% 0.66/0.88 % (687)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 (2994ds/34Mi)
% 0.66/0.88 % (688)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.66/0.88 % (689)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 (2994ds/83Mi)
% 0.66/0.88 % (686)Refutation not found, incomplete strategy% (686)------------------------------
% 0.66/0.88 % (686)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.88 % (686)Termination reason: Refutation not found, incomplete strategy
% 0.66/0.88
% 0.66/0.88 % (686)Memory used [KB]: 952
% 0.66/0.88 % (686)Time elapsed: 0.003 s
% 0.66/0.88 % (686)Instructions burned: 2 (million)
% 0.66/0.88 % (686)------------------------------
% 0.66/0.88 % (686)------------------------------
% 0.66/0.88 % (690)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 (2994ds/56Mi)
% 0.66/0.88 % (683)Refutation not found, incomplete strategy% (683)------------------------------
% 0.66/0.88 % (683)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.88 % (683)Termination reason: Refutation not found, incomplete strategy
% 0.66/0.88
% 0.66/0.88 % (683)Memory used [KB]: 969
% 0.66/0.88 % (683)Time elapsed: 0.003 s
% 0.66/0.88 % (683)Instructions burned: 3 (million)
% 0.66/0.88 % (683)------------------------------
% 0.66/0.88 % (683)------------------------------
% 0.66/0.88 % (690)Refutation not found, incomplete strategy% (690)------------------------------
% 0.66/0.88 % (690)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.88 % (690)Termination reason: Refutation not found, incomplete strategy
% 0.66/0.88
% 0.66/0.88 % (690)Memory used [KB]: 954
% 0.66/0.88 % (690)Time elapsed: 0.003 s
% 0.66/0.88 % (690)Instructions burned: 2 (million)
% 0.66/0.88 % (690)------------------------------
% 0.66/0.88 % (690)------------------------------
% 0.66/0.88 % (685)First to succeed.
% 0.66/0.88 % (687)Refutation not found, incomplete strategy% (687)------------------------------
% 0.66/0.88 % (687)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.88 % (687)Termination reason: Refutation not found, incomplete strategy
% 0.66/0.88
% 0.66/0.88 % (687)Memory used [KB]: 1042
% 0.66/0.88 % (687)Time elapsed: 0.004 s
% 0.66/0.88 % (687)Instructions burned: 4 (million)
% 0.66/0.88 % (687)------------------------------
% 0.66/0.88 % (687)------------------------------
% 0.66/0.88 % (685)Refutation found. Thanks to Tanya!
% 0.66/0.88 % SZS status Theorem for Vampire---4
% 0.66/0.88 % SZS output start Proof for Vampire---4
% See solution above
% 0.66/0.89 % (685)------------------------------
% 0.66/0.89 % (685)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.89 % (685)Termination reason: Refutation
% 0.66/0.89
% 0.66/0.89 % (685)Memory used [KB]: 1054
% 0.66/0.89 % (685)Time elapsed: 0.005 s
% 0.66/0.89 % (685)Instructions burned: 6 (million)
% 0.66/0.89 % (685)------------------------------
% 0.66/0.89 % (685)------------------------------
% 0.66/0.89 % (609)Success in time 0.504 s
% 0.66/0.89 % Vampire---4.8 exiting
%------------------------------------------------------------------------------