TSTP Solution File: SYN078+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN078+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 : 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 : Wed May 1 04:33:14 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 1 unt; 0 def)
% Number of atoms : 129 ( 18 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 144 ( 53 ~; 53 |; 22 &)
% ( 8 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 36 ( 23 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,plain,
$false,
inference(avatar_sat_refutation,[],[f26,f31,f36,f41,f42,f43,f47,f49,f51]) ).
fof(f51,plain,
( ~ spl3_4
| spl3_1
| ~ spl3_3
| ~ spl3_6 ),
inference(avatar_split_clause,[],[f50,f45,f28,f19,f33]) ).
fof(f33,plain,
( spl3_4
<=> big_p(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f19,plain,
( spl3_1
<=> big_p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f28,plain,
( spl3_3
<=> sK1 = f(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f45,plain,
( spl3_6
<=> ! [X5] :
( big_p(f(X5))
| ~ big_p(X5) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f50,plain,
( big_p(sK1)
| ~ big_p(sK2)
| ~ spl3_3
| ~ spl3_6 ),
inference(superposition,[],[f46,f30]) ).
fof(f30,plain,
( sK1 = f(sK2)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f46,plain,
( ! [X5] :
( big_p(f(X5))
| ~ big_p(X5) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f49,plain,
( ~ spl3_5
| spl3_2
| ~ spl3_6 ),
inference(avatar_split_clause,[],[f48,f45,f23,f38]) ).
fof(f38,plain,
( spl3_5
<=> big_p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f23,plain,
( spl3_2
<=> big_p(f(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f48,plain,
( ~ big_p(sK0)
| spl3_2
| ~ spl3_6 ),
inference(resolution,[],[f46,f25]) ).
fof(f25,plain,
( ~ big_p(f(sK0))
| spl3_2 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f47,plain,
( spl3_6
| spl3_6 ),
inference(avatar_split_clause,[],[f17,f45,f45]) ).
fof(f17,plain,
! [X3,X5] :
( big_p(f(X3))
| ~ big_p(X3)
| big_p(f(X5))
| ~ big_p(X5) ),
inference(equality_resolution,[],[f10]) ).
fof(f10,plain,
! [X3,X4,X5] :
( big_p(f(X3))
| ~ big_p(X3)
| big_p(X4)
| f(X5) != X4
| ~ big_p(X5) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ( ( ~ big_p(f(sK0))
& big_p(sK0) )
| ( ~ big_p(sK1)
& sK1 = f(sK2)
& big_p(sK2) ) )
& ( ! [X3] :
( big_p(f(X3))
| ~ big_p(X3) )
| ! [X4] :
( big_p(X4)
| ! [X5] :
( f(X5) != X4
| ~ big_p(X5) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f8,f7,f6]) ).
fof(f6,plain,
( ? [X0] :
( ~ big_p(f(X0))
& big_p(X0) )
=> ( ~ big_p(f(sK0))
& big_p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X1] :
( ~ big_p(X1)
& ? [X2] :
( f(X2) = X1
& big_p(X2) ) )
=> ( ~ big_p(sK1)
& ? [X2] :
( f(X2) = sK1
& big_p(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X2] :
( f(X2) = sK1
& big_p(X2) )
=> ( sK1 = f(sK2)
& big_p(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ( ? [X0] :
( ~ big_p(f(X0))
& big_p(X0) )
| ? [X1] :
( ~ big_p(X1)
& ? [X2] :
( f(X2) = X1
& big_p(X2) ) ) )
& ( ! [X3] :
( big_p(f(X3))
| ~ big_p(X3) )
| ! [X4] :
( big_p(X4)
| ! [X5] :
( f(X5) != X4
| ~ big_p(X5) ) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
( ( ? [X2] :
( ~ big_p(f(X2))
& big_p(X2) )
| ? [X0] :
( ~ big_p(X0)
& ? [X1] :
( f(X1) = X0
& big_p(X1) ) ) )
& ( ! [X2] :
( big_p(f(X2))
| ~ big_p(X2) )
| ! [X0] :
( big_p(X0)
| ! [X1] :
( f(X1) != X0
| ~ big_p(X1) ) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
( ! [X0] :
( big_p(X0)
| ! [X1] :
( f(X1) != X0
| ~ big_p(X1) ) )
<~> ! [X2] :
( big_p(f(X2))
| ~ big_p(X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ? [X1] :
( f(X1) = X0
& big_p(X1) )
=> big_p(X0) )
<=> ! [X2] :
( big_p(X2)
=> big_p(f(X2)) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( ? [X1] :
( f(X1) = X0
& big_p(X1) )
=> big_p(X0) )
<=> ! [X2] :
( big_p(X2)
=> big_p(f(X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uQzMWOcenY/Vampire---4.8_32492',pel56) ).
fof(f43,plain,
( spl3_4
| spl3_5 ),
inference(avatar_split_clause,[],[f11,f38,f33]) ).
fof(f11,plain,
( big_p(sK0)
| big_p(sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f42,plain,
( spl3_3
| spl3_5 ),
inference(avatar_split_clause,[],[f12,f38,f28]) ).
fof(f12,plain,
( big_p(sK0)
| sK1 = f(sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f41,plain,
( ~ spl3_1
| spl3_5 ),
inference(avatar_split_clause,[],[f13,f38,f19]) ).
fof(f13,plain,
( big_p(sK0)
| ~ big_p(sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f36,plain,
( spl3_4
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f14,f23,f33]) ).
fof(f14,plain,
( ~ big_p(f(sK0))
| big_p(sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f31,plain,
( spl3_3
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f15,f23,f28]) ).
fof(f15,plain,
( ~ big_p(f(sK0))
| sK1 = f(sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f26,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f16,f23,f19]) ).
fof(f16,plain,
( ~ big_p(f(sK0))
| ~ big_p(sK1) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN078+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/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.15/0.35 % Computer : n002.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 17:40:25 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ 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.uQzMWOcenY/Vampire---4.8_32492
% 0.55/0.75 % (32705)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.55/0.75 % (32711)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.55/0.75 % (32705)First to succeed.
% 0.55/0.76 % (32711)Refutation not found, incomplete strategy% (32711)------------------------------
% 0.55/0.76 % (32711)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (32711)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76
% 0.55/0.76 % (32711)Memory used [KB]: 976
% 0.55/0.76 % (32711)Time elapsed: 0.003 s
% 0.55/0.76 % (32711)Instructions burned: 2 (million)
% 0.55/0.76 % (32711)------------------------------
% 0.55/0.76 % (32711)------------------------------
% 0.55/0.76 % (32706)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.55/0.76 % (32704)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.55/0.76 % (32707)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.55/0.76 % (32708)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.55/0.76 % (32709)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.55/0.76 % (32710)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.55/0.76 % (32705)Refutation found. Thanks to Tanya!
% 0.55/0.76 % SZS status Theorem for Vampire---4
% 0.55/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.76 % (32705)------------------------------
% 0.55/0.76 % (32705)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (32705)Termination reason: Refutation
% 0.55/0.76
% 0.55/0.76 % (32705)Memory used [KB]: 983
% 0.55/0.76 % (32705)Time elapsed: 0.004 s
% 0.55/0.76 % (32705)Instructions burned: 3 (million)
% 0.55/0.76 % (32705)------------------------------
% 0.55/0.76 % (32705)------------------------------
% 0.55/0.76 % (32680)Success in time 0.393 s
% 0.62/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------