TSTP Solution File: SYN367+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN367+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n027.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 : Tue May 21 08:35:15 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 79 ( 31 ~; 18 |; 22 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 27 ( 19 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f32,plain,
$false,
inference(avatar_sat_refutation,[],[f23,f27,f29,f31]) ).
fof(f31,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f30]) ).
fof(f30,plain,
( $false
| ~ spl2_1 ),
inference(resolution,[],[f18,f14]) ).
fof(f14,plain,
~ big_q(sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ~ big_r(sK0)
& ~ big_q(sK1)
& ! [X2] :
( ( big_r(X2)
& ~ p )
| ( big_q(X2)
& p ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0] : ~ big_r(X0)
=> ~ big_r(sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X1] : ~ big_q(X1)
=> ~ big_q(sK1) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ? [X0] : ~ big_r(X0)
& ? [X1] : ~ big_q(X1)
& ! [X2] :
( ( big_r(X2)
& ~ p )
| ( big_q(X2)
& p ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ? [X1] : ~ big_r(X1)
& ? [X2] : ~ big_q(X2)
& ! [X0] :
( ( big_r(X0)
& ~ p )
| ( big_q(X0)
& p ) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X1] : ~ big_r(X1)
& ? [X2] : ~ big_q(X2)
& ! [X0] :
( ( big_r(X0)
& ~ p )
| ( big_q(X0)
& p ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X0] :
( ( big_r(X0)
& ~ p )
| ( big_q(X0)
& p ) )
=> ( ! [X1] : big_r(X1)
| ! [X2] : big_q(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ( big_r(X0)
& ~ p )
| ( big_q(X0)
& p ) )
=> ( ! [X0] : big_r(X0)
| ! [X0] : big_q(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( ( big_r(X0)
& ~ p )
| ( big_q(X0)
& p ) )
=> ( ! [X0] : big_r(X0)
| ! [X0] : big_q(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2118) ).
fof(f18,plain,
( ! [X2] : big_q(X2)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f17,plain,
( spl2_1
<=> ! [X2] : big_q(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f29,plain,
~ spl2_3,
inference(avatar_contradiction_clause,[],[f28]) ).
fof(f28,plain,
( $false
| ~ spl2_3 ),
inference(resolution,[],[f26,f15]) ).
fof(f15,plain,
~ big_r(sK0),
inference(cnf_transformation,[],[f9]) ).
fof(f26,plain,
( ! [X2] : big_r(X2)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f25,plain,
( spl2_3
<=> ! [X2] : big_r(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f27,plain,
( spl2_2
| spl2_3 ),
inference(avatar_split_clause,[],[f12,f25,f20]) ).
fof(f20,plain,
( spl2_2
<=> p ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f12,plain,
! [X2] :
( big_r(X2)
| p ),
inference(cnf_transformation,[],[f9]) ).
fof(f23,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f11,f20,f17]) ).
fof(f11,plain,
! [X2] :
( ~ p
| big_q(X2) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN367+1 : TPTP v8.2.0. Released v2.0.0.
% 0.07/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 14:02:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % (12721)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (12724)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.13/0.37 % (12724)First to succeed.
% 0.13/0.37 % (12724)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12721"
% 0.13/0.37 % (12724)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (12724)------------------------------
% 0.13/0.37 % (12724)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37 % (12724)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (12724)Memory used [KB]: 742
% 0.13/0.37 % (12724)Time elapsed: 0.004 s
% 0.13/0.37 % (12724)Instructions burned: 2 (million)
% 0.13/0.37 % (12721)Success in time 0.016 s
%------------------------------------------------------------------------------