TSTP Solution File: SYN375+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN375+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n025.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:57:06 EDT 2024
% Result : Theorem 0.62s 0.84s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 46 ( 1 unt; 0 def)
% Number of atoms : 165 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 190 ( 71 ~; 77 |; 17 &)
% ( 17 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 7 prp; 0-1 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 73 ( 42 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f81,plain,
$false,
inference(avatar_sat_refutation,[],[f34,f48,f49,f66,f68,f70,f74,f78,f80]) ).
fof(f80,plain,
( ~ spl7_2
| ~ spl7_6 ),
inference(avatar_contradiction_clause,[],[f79]) ).
fof(f79,plain,
( $false
| ~ spl7_2
| ~ spl7_6 ),
inference(subsumption_resolution,[],[f46,f29]) ).
fof(f29,plain,
( ! [X5] : ~ big_p(X5)
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f28,plain,
( spl7_2
<=> ! [X5] : ~ big_p(X5) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f46,plain,
( big_p(sK1)
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f44,plain,
( spl7_6
<=> big_p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_6])]) ).
fof(f78,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_contradiction_clause,[],[f77]) ).
fof(f77,plain,
( $false
| ~ spl7_1
| ~ spl7_2 ),
inference(subsumption_resolution,[],[f25,f29]) ).
fof(f25,plain,
( big_p(sK2)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl7_1
<=> big_p(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f74,plain,
( ~ spl7_2
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f73]) ).
fof(f73,plain,
( $false
| ~ spl7_2
| ~ spl7_5 ),
inference(subsumption_resolution,[],[f29,f42]) ).
fof(f42,plain,
( ! [X3] : big_p(X3)
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f41,plain,
( spl7_5
<=> ! [X3] : big_p(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
fof(f70,plain,
( spl7_3
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f69]) ).
fof(f69,plain,
( $false
| spl7_3
| ~ spl7_5 ),
inference(subsumption_resolution,[],[f33,f42]) ).
fof(f33,plain,
( ~ big_p(sK0)
| spl7_3 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f31,plain,
( spl7_3
<=> big_p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f68,plain,
( spl7_1
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f67]) ).
fof(f67,plain,
( $false
| spl7_1
| ~ spl7_5 ),
inference(subsumption_resolution,[],[f26,f42]) ).
fof(f26,plain,
( ~ big_p(sK2)
| spl7_1 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f66,plain,
( ~ spl7_2
| ~ spl7_4 ),
inference(avatar_contradiction_clause,[],[f65]) ).
fof(f65,plain,
( $false
| ~ spl7_2
| ~ spl7_4 ),
inference(resolution,[],[f38,f29]) ).
fof(f38,plain,
( big_p(sK3)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f36,plain,
( spl7_4
<=> big_p(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f49,plain,
( spl7_2
| spl7_5
| spl7_2
| spl7_5 ),
inference(avatar_split_clause,[],[f18,f41,f28,f41,f28]) ).
fof(f18,plain,
! [X11,X8,X7,X12] :
( big_p(X7)
| ~ big_p(X8)
| big_p(X11)
| ~ big_p(X12) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ( ( ( ! [X0] : ~ big_p(X0)
| ~ big_p(sK0) )
& ( big_p(sK1)
| ! [X3] : big_p(X3) ) )
| ( ( ! [X5] : ~ big_p(X5)
| ~ big_p(sK2) )
& ( big_p(sK3)
| big_p(sK2) ) ) )
& ( ( ( ! [X7] : big_p(X7)
| ! [X8] : ~ big_p(X8) )
& ( big_p(sK4)
| ~ big_p(sK5) ) )
| ! [X11] :
( ( big_p(X11)
| ! [X12] : ~ big_p(X12) )
& ( big_p(sK6)
| ~ big_p(X11) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f6,f13,f12,f11,f10,f9,f8,f7]) ).
fof(f7,plain,
( ? [X1] : ~ big_p(X1)
=> ~ big_p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X2] : big_p(X2)
=> big_p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] :
( ( ! [X5] : ~ big_p(X5)
| ~ big_p(X4) )
& ( ? [X6] : big_p(X6)
| big_p(X4) ) )
=> ( ( ! [X5] : ~ big_p(X5)
| ~ big_p(sK2) )
& ( ? [X6] : big_p(X6)
| big_p(sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X6] : big_p(X6)
=> big_p(sK3) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ? [X9] : big_p(X9)
=> big_p(sK4) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X10] : ~ big_p(X10)
=> ~ big_p(sK5) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ? [X13] : big_p(X13)
=> big_p(sK6) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ( ( ! [X0] : ~ big_p(X0)
| ? [X1] : ~ big_p(X1) )
& ( ? [X2] : big_p(X2)
| ! [X3] : big_p(X3) ) )
| ? [X4] :
( ( ! [X5] : ~ big_p(X5)
| ~ big_p(X4) )
& ( ? [X6] : big_p(X6)
| big_p(X4) ) ) )
& ( ( ( ! [X7] : big_p(X7)
| ! [X8] : ~ big_p(X8) )
& ( ? [X9] : big_p(X9)
| ? [X10] : ~ big_p(X10) ) )
| ! [X11] :
( ( big_p(X11)
| ! [X12] : ~ big_p(X12) )
& ( ? [X13] : big_p(X13)
| ~ big_p(X11) ) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ( ( ! [X3] : ~ big_p(X3)
| ? [X2] : ~ big_p(X2) )
& ( ? [X3] : big_p(X3)
| ! [X2] : big_p(X2) ) )
| ? [X0] :
( ( ! [X1] : ~ big_p(X1)
| ~ big_p(X0) )
& ( ? [X1] : big_p(X1)
| big_p(X0) ) ) )
& ( ( ( ! [X2] : big_p(X2)
| ! [X3] : ~ big_p(X3) )
& ( ? [X3] : big_p(X3)
| ? [X2] : ~ big_p(X2) ) )
| ! [X0] :
( ( big_p(X0)
| ! [X1] : ~ big_p(X1) )
& ( ? [X1] : big_p(X1)
| ~ big_p(X0) ) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<~> ( ! [X2] : big_p(X2)
<=> ? [X3] : big_p(X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<=> ( ! [X2] : big_p(X2)
<=> ? [X3] : big_p(X3) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<=> ( ! [X0] : big_p(X0)
<=> ? [X1] : big_p(X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<=> ( ! [X0] : big_p(X0)
<=> ? [X1] : big_p(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.2DlvEIEQtw/Vampire---4.8_5213',x2126) ).
fof(f48,plain,
( spl7_1
| spl7_4
| spl7_5
| spl7_6 ),
inference(avatar_split_clause,[],[f19,f44,f41,f36,f24]) ).
fof(f19,plain,
! [X3] :
( big_p(sK1)
| big_p(X3)
| big_p(sK3)
| big_p(sK2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f34,plain,
( ~ spl7_1
| spl7_2
| ~ spl7_3
| spl7_2 ),
inference(avatar_split_clause,[],[f22,f28,f31,f28,f24]) ).
fof(f22,plain,
! [X0,X5] :
( ~ big_p(X0)
| ~ big_p(sK0)
| ~ big_p(X5)
| ~ big_p(sK2) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN375+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n025.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 : Fri May 3 17:23:38 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_NEQ problem
% 0.16/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.2DlvEIEQtw/Vampire---4.8_5213
% 0.62/0.84 % (5540)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.62/0.84 % (5538)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 (2995ds/34Mi)
% 0.62/0.84 % (5541)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.62/0.84 % (5542)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 (2995ds/34Mi)
% 0.62/0.84 % (5539)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 (2995ds/51Mi)
% 0.62/0.84 % (5545)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 (2995ds/56Mi)
% 0.62/0.84 % (5543)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.62/0.84 % (5544)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 (2995ds/83Mi)
% 0.62/0.84 % (5539)Also succeeded, but the first one will report.
% 0.62/0.84 % (5543)Also succeeded, but the first one will report.
% 0.62/0.84 % (5542)Also succeeded, but the first one will report.
% 0.62/0.84 % (5540)Also succeeded, but the first one will report.
% 0.62/0.84 % (5538)Also succeeded, but the first one will report.
% 0.62/0.84 % (5545)First to succeed.
% 0.62/0.84 % (5541)Also succeeded, but the first one will report.
% 0.62/0.84 % (5544)Also succeeded, but the first one will report.
% 0.62/0.84 % (5545)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5468"
% 0.62/0.84 % (5545)Refutation found. Thanks to Tanya!
% 0.62/0.84 % SZS status Theorem for Vampire---4
% 0.62/0.84 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.84 % (5545)------------------------------
% 0.62/0.84 % (5545)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.84 % (5545)Termination reason: Refutation
% 0.62/0.84
% 0.62/0.84 % (5545)Memory used [KB]: 987
% 0.62/0.84 % (5545)Time elapsed: 0.004 s
% 0.62/0.84 % (5545)Instructions burned: 3 (million)
% 0.62/0.84 % (5468)Success in time 0.473 s
% 0.62/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------