TSTP Solution File: SYN084+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN084+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 : n021.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:16 EDT 2024
% Result : Theorem 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 79 ( 2 unt; 0 def)
% Number of atoms : 315 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 378 ( 142 ~; 164 |; 51 &)
% ( 12 <=>; 6 =>; 0 <=; 3 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 12 ( 11 usr; 10 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 45 ( 39 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f99,plain,
$false,
inference(avatar_sat_refutation,[],[f42,f51,f58,f62,f74,f78,f81,f89,f91,f98]) ).
fof(f98,plain,
( ~ spl4_1
| spl4_2
| spl4_3 ),
inference(avatar_contradiction_clause,[],[f97]) ).
fof(f97,plain,
( $false
| ~ spl4_1
| spl4_2
| spl4_3 ),
inference(subsumption_resolution,[],[f96,f94]) ).
fof(f94,plain,
( ~ big_p(sK3)
| spl4_3 ),
inference(resolution,[],[f46,f26]) ).
fof(f26,plain,
! [X0] :
( sP0(X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0] :
( ( sP0(X0)
| ( ~ big_p(f(f(X0)))
& ~ big_p(X0)
& big_p(a) ) )
& ( big_p(f(f(X0)))
| big_p(X0)
| ~ big_p(a)
| ~ sP0(X0) ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X1] :
( ( sP0(X1)
| ( ~ big_p(f(f(X1)))
& ~ big_p(X1)
& big_p(a) ) )
& ( big_p(f(f(X1)))
| big_p(X1)
| ~ big_p(a)
| ~ sP0(X1) ) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X1] :
( ( sP0(X1)
| ( ~ big_p(f(f(X1)))
& ~ big_p(X1)
& big_p(a) ) )
& ( big_p(f(f(X1)))
| big_p(X1)
| ~ big_p(a)
| ~ sP0(X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
! [X1] :
( sP0(X1)
<=> ( big_p(f(f(X1)))
| big_p(X1)
| ~ big_p(a) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f46,plain,
( ~ sP0(sK3)
| spl4_3 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f44,plain,
( spl4_3
<=> sP0(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f96,plain,
( big_p(sK3)
| ~ spl4_1
| spl4_2 ),
inference(resolution,[],[f92,f41]) ).
fof(f41,plain,
( ~ big_p(f(f(sK3)))
| spl4_2 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f39,plain,
( spl4_2
<=> big_p(f(f(sK3))) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f92,plain,
( ! [X0] :
( big_p(f(f(X0)))
| big_p(X0) )
| ~ spl4_1 ),
inference(subsumption_resolution,[],[f84,f53]) ).
fof(f53,plain,
big_p(a),
inference(subsumption_resolution,[],[f52,f25]) ).
fof(f25,plain,
! [X0] :
( sP0(X0)
| big_p(a) ),
inference(cnf_transformation,[],[f14]) ).
fof(f52,plain,
( big_p(a)
| ~ sP0(sK3) ),
inference(subsumption_resolution,[],[f30,f21]) ).
fof(f21,plain,
( sP1
| big_p(a) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( sP1
| ( ~ big_p(f(f(sK2)))
& ( big_p(f(sK2))
| ~ big_p(sK2) )
& big_p(a) ) )
& ( ! [X1] :
( big_p(f(f(X1)))
| ( ~ big_p(f(X1))
& big_p(X1) )
| ~ big_p(a) )
| ~ sP1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f9,f10]) ).
fof(f10,plain,
( ? [X0] :
( ~ big_p(f(f(X0)))
& ( big_p(f(X0))
| ~ big_p(X0) )
& big_p(a) )
=> ( ~ big_p(f(f(sK2)))
& ( big_p(f(sK2))
| ~ big_p(sK2) )
& big_p(a) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ( sP1
| ? [X0] :
( ~ big_p(f(f(X0)))
& ( big_p(f(X0))
| ~ big_p(X0) )
& big_p(a) ) )
& ( ! [X1] :
( big_p(f(f(X1)))
| ( ~ big_p(f(X1))
& big_p(X1) )
| ~ big_p(a) )
| ~ sP1 ) ),
inference(rectify,[],[f8]) ).
fof(f8,plain,
( ( sP1
| ? [X0] :
( ~ big_p(f(f(X0)))
& ( big_p(f(X0))
| ~ big_p(X0) )
& big_p(a) ) )
& ( ! [X0] :
( big_p(f(f(X0)))
| ( ~ big_p(f(X0))
& big_p(X0) )
| ~ big_p(a) )
| ~ sP1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
( sP1
<=> ! [X0] :
( big_p(f(f(X0)))
| ( ~ big_p(f(X0))
& big_p(X0) )
| ~ big_p(a) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f30,plain,
( big_p(a)
| ~ sP0(sK3)
| ~ sP1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ( ( ~ big_p(f(f(sK3)))
& big_p(f(sK3))
& big_p(a) )
| ~ sP0(sK3)
| ~ sP1 )
& ( ! [X1] :
( ( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) )
& sP0(X1) )
| sP1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f16,f17]) ).
fof(f17,plain,
( ? [X0] :
( ( ~ big_p(f(f(X0)))
& big_p(f(X0))
& big_p(a) )
| ~ sP0(X0) )
=> ( ( ~ big_p(f(f(sK3)))
& big_p(f(sK3))
& big_p(a) )
| ~ sP0(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ( ? [X0] :
( ( ~ big_p(f(f(X0)))
& big_p(f(X0))
& big_p(a) )
| ~ sP0(X0) )
| ~ sP1 )
& ( ! [X1] :
( ( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) )
& sP0(X1) )
| sP1 ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
( ( ? [X1] :
( ( ~ big_p(f(f(X1)))
& big_p(f(X1))
& big_p(a) )
| ~ sP0(X1) )
| ~ sP1 )
& ( ! [X1] :
( ( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) )
& sP0(X1) )
| sP1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,plain,
( sP1
<~> ! [X1] :
( ( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) )
& sP0(X1) ) ),
inference(definition_folding,[],[f4,f6,f5]) ).
fof(f4,plain,
( ! [X0] :
( big_p(f(f(X0)))
| ( ~ big_p(f(X0))
& big_p(X0) )
| ~ big_p(a) )
<~> ! [X1] :
( ( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) )
& ( big_p(f(f(X1)))
| big_p(X1)
| ~ big_p(a) ) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
( ! [X0] :
( big_p(f(f(X0)))
| ( ~ big_p(f(X0))
& big_p(X0) )
| ~ big_p(a) )
<~> ! [X1] :
( ( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) )
& ( big_p(f(f(X1)))
| big_p(X1)
| ~ big_p(a) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ( ( big_p(X0)
=> big_p(f(X0)) )
& big_p(a) )
=> big_p(f(f(X0))) )
<=> ! [X1] :
( ( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) )
& ( big_p(f(f(X1)))
| big_p(X1)
| ~ big_p(a) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( ( ( big_p(X0)
=> big_p(f(X0)) )
& big_p(a) )
=> big_p(f(f(X0))) )
<=> ! [X1] :
( ( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) )
& ( big_p(f(f(X1)))
| big_p(X1)
| ~ big_p(a) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LGkUwPBTkF/Vampire---4.8_2652',pel62) ).
fof(f84,plain,
( ! [X0] :
( big_p(X0)
| ~ big_p(a)
| big_p(f(f(X0))) )
| ~ spl4_1 ),
inference(resolution,[],[f36,f19]) ).
fof(f19,plain,
! [X1] :
( ~ sP1
| big_p(X1)
| ~ big_p(a)
| big_p(f(f(X1))) ),
inference(cnf_transformation,[],[f11]) ).
fof(f36,plain,
( sP1
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f35,plain,
( spl4_1
<=> sP1 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f91,plain,
( spl4_5
| ~ spl4_1 ),
inference(avatar_split_clause,[],[f90,f35,f56]) ).
fof(f56,plain,
( spl4_5
<=> ! [X1] :
( big_p(f(f(X1)))
| ~ big_p(f(X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
fof(f90,plain,
( ! [X0] :
( ~ big_p(f(X0))
| big_p(f(f(X0))) )
| ~ spl4_1 ),
inference(subsumption_resolution,[],[f85,f53]) ).
fof(f85,plain,
( ! [X0] :
( ~ big_p(f(X0))
| ~ big_p(a)
| big_p(f(f(X0))) )
| ~ spl4_1 ),
inference(resolution,[],[f36,f20]) ).
fof(f20,plain,
! [X1] :
( ~ sP1
| ~ big_p(f(X1))
| ~ big_p(a)
| big_p(f(f(X1))) ),
inference(cnf_transformation,[],[f11]) ).
fof(f89,plain,
( spl4_2
| ~ spl4_4
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f88]) ).
fof(f88,plain,
( $false
| spl4_2
| ~ spl4_4
| ~ spl4_5 ),
inference(subsumption_resolution,[],[f87,f50]) ).
fof(f50,plain,
( big_p(f(sK3))
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f48,plain,
( spl4_4
<=> big_p(f(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f87,plain,
( ~ big_p(f(sK3))
| spl4_2
| ~ spl4_5 ),
inference(resolution,[],[f41,f57]) ).
fof(f57,plain,
( ! [X1] :
( big_p(f(f(X1)))
| ~ big_p(f(X1)) )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f81,plain,
( spl4_1
| ~ spl4_6
| spl4_7 ),
inference(avatar_contradiction_clause,[],[f80]) ).
fof(f80,plain,
( $false
| spl4_1
| ~ spl4_6
| spl4_7 ),
inference(subsumption_resolution,[],[f79,f69]) ).
fof(f69,plain,
( ~ big_p(sK2)
| spl4_7 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f67,plain,
( spl4_7
<=> big_p(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_7])]) ).
fof(f79,plain,
( big_p(sK2)
| spl4_1
| ~ spl4_6 ),
inference(resolution,[],[f76,f65]) ).
fof(f65,plain,
( ~ big_p(f(f(sK2)))
| spl4_1 ),
inference(resolution,[],[f37,f23]) ).
fof(f23,plain,
( sP1
| ~ big_p(f(f(sK2))) ),
inference(cnf_transformation,[],[f11]) ).
fof(f37,plain,
( ~ sP1
| spl4_1 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f76,plain,
( ! [X0] :
( big_p(f(f(X0)))
| big_p(X0) )
| ~ spl4_6 ),
inference(subsumption_resolution,[],[f75,f53]) ).
fof(f75,plain,
( ! [X0] :
( big_p(X0)
| ~ big_p(a)
| big_p(f(f(X0))) )
| ~ spl4_6 ),
inference(resolution,[],[f61,f24]) ).
fof(f24,plain,
! [X0] :
( ~ sP0(X0)
| big_p(X0)
| ~ big_p(a)
| big_p(f(f(X0))) ),
inference(cnf_transformation,[],[f14]) ).
fof(f61,plain,
( ! [X1] : sP0(X1)
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f60,plain,
( spl4_6
<=> ! [X1] : sP0(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
fof(f78,plain,
( ~ spl4_8
| spl4_1
| ~ spl4_5 ),
inference(avatar_split_clause,[],[f77,f56,f35,f71]) ).
fof(f71,plain,
( spl4_8
<=> big_p(f(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_8])]) ).
fof(f77,plain,
( ~ big_p(f(sK2))
| spl4_1
| ~ spl4_5 ),
inference(resolution,[],[f65,f57]) ).
fof(f74,plain,
( ~ spl4_7
| spl4_8
| spl4_1 ),
inference(avatar_split_clause,[],[f64,f35,f71,f67]) ).
fof(f64,plain,
( big_p(f(sK2))
| ~ big_p(sK2)
| spl4_1 ),
inference(resolution,[],[f37,f22]) ).
fof(f22,plain,
( sP1
| big_p(f(sK2))
| ~ big_p(sK2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f62,plain,
( spl4_1
| spl4_6 ),
inference(avatar_split_clause,[],[f28,f60,f35]) ).
fof(f28,plain,
! [X1] :
( sP0(X1)
| sP1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f58,plain,
( spl4_1
| spl4_5 ),
inference(avatar_split_clause,[],[f54,f56,f35]) ).
fof(f54,plain,
! [X1] :
( big_p(f(f(X1)))
| ~ big_p(f(X1))
| sP1 ),
inference(subsumption_resolution,[],[f29,f53]) ).
fof(f29,plain,
! [X1] :
( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a)
| sP1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f51,plain,
( ~ spl4_1
| ~ spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f31,f48,f44,f35]) ).
fof(f31,plain,
( big_p(f(sK3))
| ~ sP0(sK3)
| ~ sP1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f42,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f33,f39,f35]) ).
fof(f33,plain,
( ~ big_p(f(f(sK3)))
| ~ sP1 ),
inference(subsumption_resolution,[],[f32,f27]) ).
fof(f27,plain,
! [X0] :
( sP0(X0)
| ~ big_p(f(f(X0))) ),
inference(cnf_transformation,[],[f14]) ).
fof(f32,plain,
( ~ big_p(f(f(sK3)))
| ~ sP0(sK3)
| ~ sP1 ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SYN084+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.16/0.36 % Computer : n021.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 17:26:11 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_NEQ problem
% 0.16/0.37 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.LGkUwPBTkF/Vampire---4.8_2652
% 0.56/0.74 % (2868)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.56/0.74 % (2869)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.56/0.75 % (2862)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.56/0.75 % (2864)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.56/0.75 % (2869)First to succeed.
% 0.56/0.75 % (2865)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.56/0.75 % (2866)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.56/0.75 % (2867)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.56/0.75 % (2863)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.56/0.75 % (2868)Also succeeded, but the first one will report.
% 0.56/0.75 % (2869)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Theorem for Vampire---4
% 0.56/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.75 % (2869)------------------------------
% 0.56/0.75 % (2869)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.75 % (2869)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (2869)Memory used [KB]: 999
% 0.56/0.75 % (2869)Time elapsed: 0.003 s
% 0.56/0.75 % (2869)Instructions burned: 5 (million)
% 0.56/0.75 % (2869)------------------------------
% 0.56/0.75 % (2869)------------------------------
% 0.56/0.75 % (2829)Success in time 0.373 s
% 0.56/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------