TSTP Solution File: SYN374+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN374+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n008.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 12:09:56 EDT 2024
% Result : Theorem 0.16s 0.40s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 59 ( 1 unt; 0 def)
% Number of atoms : 210 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 247 ( 96 ~; 99 |; 22 &)
% ( 22 <=>; 6 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 10 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 77 ( 49 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f89,plain,
$false,
inference(avatar_sat_refutation,[],[f34,f38,f46,f50,f55,f60,f70,f72,f74,f76,f79,f88]) ).
fof(f88,plain,
( ~ spl7_1
| ~ spl7_6 ),
inference(avatar_contradiction_clause,[],[f87]) ).
fof(f87,plain,
( $false
| ~ spl7_1
| ~ spl7_6 ),
inference(subsumption_resolution,[],[f86,f49]) ).
fof(f49,plain,
( ! [X3] : big_p(X3)
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f48,plain,
( spl7_6
<=> ! [X3] : big_p(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_6])]) ).
fof(f86,plain,
( ! [X0] : ~ big_p(X0)
| ~ spl7_1
| ~ spl7_6 ),
inference(subsumption_resolution,[],[f29,f49]) ).
fof(f29,plain,
( ! [X0] :
( ~ big_p(sK1(X0))
| ~ big_p(X0) )
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f28,plain,
( spl7_1
<=> ! [X0] :
( ~ big_p(sK1(X0))
| ~ big_p(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f79,plain,
( ~ spl7_3
| ~ spl7_4 ),
inference(avatar_contradiction_clause,[],[f78]) ).
fof(f78,plain,
( $false
| ~ spl7_3
| ~ spl7_4 ),
inference(subsumption_resolution,[],[f77,f41]) ).
fof(f41,plain,
( ! [X3] : ~ big_p(X3)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f40,plain,
( spl7_4
<=> ! [X3] : ~ big_p(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f77,plain,
( ! [X0] : big_p(X0)
| ~ spl7_3
| ~ spl7_4 ),
inference(subsumption_resolution,[],[f37,f41]) ).
fof(f37,plain,
( ! [X0] :
( big_p(sK1(X0))
| big_p(X0) )
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f36,plain,
( spl7_3
<=> ! [X0] :
( big_p(sK1(X0))
| big_p(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f76,plain,
( ~ spl7_4
| ~ spl7_8 ),
inference(avatar_contradiction_clause,[],[f75]) ).
fof(f75,plain,
( $false
| ~ spl7_4
| ~ spl7_8 ),
inference(resolution,[],[f41,f59]) ).
fof(f59,plain,
( big_p(sK4)
| ~ spl7_8 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f57,plain,
( spl7_8
<=> big_p(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_8])]) ).
fof(f74,plain,
( ~ spl7_6
| spl7_7 ),
inference(avatar_contradiction_clause,[],[f73]) ).
fof(f73,plain,
( $false
| ~ spl7_6
| spl7_7 ),
inference(resolution,[],[f49,f54]) ).
fof(f54,plain,
( ~ big_p(sK3)
| spl7_7 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f52,plain,
( spl7_7
<=> big_p(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_7])]) ).
fof(f72,plain,
( ~ spl7_4
| ~ spl7_6 ),
inference(avatar_contradiction_clause,[],[f71]) ).
fof(f71,plain,
( $false
| ~ spl7_4
| ~ spl7_6 ),
inference(subsumption_resolution,[],[f49,f41]) ).
fof(f70,plain,
( spl7_2
| spl7_4
| spl7_6 ),
inference(avatar_split_clause,[],[f23,f48,f40,f31]) ).
fof(f31,plain,
( spl7_2
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f23,plain,
! [X6,X7] :
( big_p(X6)
| ~ big_p(X7)
| sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ( ( ( ~ big_p(sK3)
| ! [X1] : ~ big_p(X1) )
& ( ! [X2] : big_p(X2)
| big_p(sK4) ) )
| ~ sP0 )
& ( ( ( big_p(sK5)
| ~ big_p(sK6) )
& ( ! [X6] : big_p(X6)
| ! [X7] : ~ big_p(X7) ) )
| sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f13,f17,f16,f15,f14]) ).
fof(f14,plain,
( ? [X0] : ~ big_p(X0)
=> ~ big_p(sK3) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X3] : big_p(X3)
=> big_p(sK4) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X4] : big_p(X4)
=> big_p(sK5) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X5] : ~ big_p(X5)
=> ~ big_p(sK6) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ( ( ( ? [X0] : ~ big_p(X0)
| ! [X1] : ~ big_p(X1) )
& ( ! [X2] : big_p(X2)
| ? [X3] : big_p(X3) ) )
| ~ sP0 )
& ( ( ( ? [X4] : big_p(X4)
| ? [X5] : ~ big_p(X5) )
& ( ! [X6] : big_p(X6)
| ! [X7] : ~ big_p(X7) ) )
| sP0 ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
( ( ( ( ? [X3] : ~ big_p(X3)
| ! [X2] : ~ big_p(X2) )
& ( ! [X3] : big_p(X3)
| ? [X2] : big_p(X2) ) )
| ~ sP0 )
& ( ( ( ? [X2] : big_p(X2)
| ? [X3] : ~ big_p(X3) )
& ( ! [X3] : big_p(X3)
| ! [X2] : ~ big_p(X2) ) )
| sP0 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
( sP0
<~> ( ? [X2] : big_p(X2)
<=> ! [X3] : big_p(X3) ) ),
inference(definition_folding,[],[f4,f5]) ).
fof(f5,plain,
( sP0
<=> ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f4,plain,
( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<~> ( ? [X2] : big_p(X2)
<=> ! [X3] : big_p(X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<=> ( ? [X2] : big_p(X2)
<=> ! [X3] : big_p(X3) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<=> ( ? [X0] : big_p(X0)
<=> ! [X1] : big_p(X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
! [X1] :
( big_p(X0)
<=> big_p(X1) )
<=> ( ? [X0] : big_p(X0)
<=> ! [X1] : big_p(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2125) ).
fof(f60,plain,
( ~ spl7_2
| spl7_8
| spl7_6 ),
inference(avatar_split_clause,[],[f25,f48,f57,f31]) ).
fof(f25,plain,
! [X2] :
( big_p(X2)
| big_p(sK4)
| ~ sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f55,plain,
( ~ spl7_2
| spl7_4
| ~ spl7_7 ),
inference(avatar_split_clause,[],[f26,f52,f40,f31]) ).
fof(f26,plain,
! [X1] :
( ~ big_p(sK3)
| ~ big_p(X1)
| ~ sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f50,plain,
( ~ spl7_2
| ~ spl7_5
| spl7_6 ),
inference(avatar_split_clause,[],[f19,f48,f43,f31]) ).
fof(f43,plain,
( spl7_5
<=> big_p(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
fof(f19,plain,
! [X3] :
( big_p(X3)
| ~ big_p(sK2)
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( sP0
| ! [X0] :
( ( ~ big_p(sK1(X0))
| ~ big_p(X0) )
& ( big_p(sK1(X0))
| big_p(X0) ) ) )
& ( ! [X3] :
( ( big_p(sK2)
| ~ big_p(X3) )
& ( big_p(X3)
| ~ big_p(sK2) ) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f8,f10,f9]) ).
fof(f9,plain,
! [X0] :
( ? [X1] :
( ( ~ big_p(X1)
| ~ big_p(X0) )
& ( big_p(X1)
| big_p(X0) ) )
=> ( ( ~ big_p(sK1(X0))
| ~ big_p(X0) )
& ( big_p(sK1(X0))
| big_p(X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X2] :
! [X3] :
( ( big_p(X2)
| ~ big_p(X3) )
& ( big_p(X3)
| ~ big_p(X2) ) )
=> ! [X3] :
( ( big_p(sK2)
| ~ big_p(X3) )
& ( big_p(X3)
| ~ big_p(sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ( sP0
| ! [X0] :
? [X1] :
( ( ~ big_p(X1)
| ~ big_p(X0) )
& ( big_p(X1)
| big_p(X0) ) ) )
& ( ? [X2] :
! [X3] :
( ( big_p(X2)
| ~ big_p(X3) )
& ( big_p(X3)
| ~ big_p(X2) ) )
| ~ sP0 ) ),
inference(rectify,[],[f7]) ).
fof(f7,plain,
( ( sP0
| ! [X0] :
? [X1] :
( ( ~ big_p(X1)
| ~ big_p(X0) )
& ( big_p(X1)
| big_p(X0) ) ) )
& ( ? [X0] :
! [X1] :
( ( big_p(X0)
| ~ big_p(X1) )
& ( big_p(X1)
| ~ big_p(X0) ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f46,plain,
( ~ spl7_2
| spl7_4
| spl7_5 ),
inference(avatar_split_clause,[],[f20,f43,f40,f31]) ).
fof(f20,plain,
! [X3] :
( big_p(sK2)
| ~ big_p(X3)
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f38,plain,
( spl7_3
| spl7_2 ),
inference(avatar_split_clause,[],[f21,f31,f36]) ).
fof(f21,plain,
! [X0] :
( sP0
| big_p(sK1(X0))
| big_p(X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f34,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f22,f31,f28]) ).
fof(f22,plain,
! [X0] :
( sP0
| ~ big_p(sK1(X0))
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SYN374+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.16 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.38 % Computer : n008.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Fri May 3 17:16:08 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 % (21386)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.40 % (21392)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.16/0.40 % (21389)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.16/0.40 % (21392)First to succeed.
% 0.16/0.40 % (21388)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.40 % (21392)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21386"
% 0.16/0.40 % (21391)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.16/0.40 % (21393)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.16/0.40 % (21389)Also succeeded, but the first one will report.
% 0.16/0.40 TRYING [1]
% 0.16/0.40 % (21392)Refutation found. Thanks to Tanya!
% 0.16/0.40 % SZS status Theorem for theBenchmark
% 0.16/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.40 % (21392)------------------------------
% 0.16/0.40 % (21392)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.40 % (21392)Termination reason: Refutation
% 0.16/0.40
% 0.16/0.40 % (21392)Memory used [KB]: 760
% 0.16/0.40 % (21392)Time elapsed: 0.004 s
% 0.16/0.40 % (21392)Instructions burned: 4 (million)
% 0.16/0.40 % (21386)Success in time 0.017 s
%------------------------------------------------------------------------------