TSTP Solution File: SYN940+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN940+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n017.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 Apr 30 18:11:12 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 94 ( 37 ~; 28 |; 22 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 76 ( 64 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f23,plain,
$false,
inference(subsumption_resolution,[],[f22,f16]) ).
fof(f16,plain,
! [X0] : p(f(X0)),
inference(resolution,[],[f14,f13]) ).
fof(f13,plain,
! [X4] : q(f(X4)),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
( ! [X2,X3] :
( ~ q(X2)
| ( sP0(sK2,sK1,X3,X2)
& p(f(X3)) ) )
& ! [X4] : q(f(X4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f8,f9]) ).
fof(f9,plain,
( ? [X0,X1] :
( ! [X2,X3] :
( ~ q(X2)
| ( sP0(X1,X0,X3,X2)
& p(f(X3)) ) )
& ! [X4] : q(f(X4)) )
=> ( ! [X3,X2] :
( ~ q(X2)
| ( sP0(sK2,sK1,X3,X2)
& p(f(X3)) ) )
& ! [X4] : q(f(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ q(X2)
| ( sP0(X1,X0,X3,X2)
& p(f(X3)) ) )
& ! [X4] : q(f(X4)) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
? [X0,X1] :
( ! [X3,X4] :
( ~ q(X3)
| ( sP0(X1,X0,X4,X3)
& p(f(X4)) ) )
& ! [X2] : q(f(X2)) ),
inference(definition_folding,[],[f3,f4]) ).
fof(f4,plain,
! [X1,X0,X4,X3] :
( ( ( ~ r(X1)
| ~ r(X0) )
& r(X4) )
| ~ p(X3)
| ~ sP0(X1,X0,X4,X3) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f3,plain,
? [X0,X1] :
( ! [X3,X4] :
( ~ q(X3)
| ( ( ( ( ~ r(X1)
| ~ r(X0) )
& r(X4) )
| ~ p(X3) )
& p(f(X4)) ) )
& ! [X2] : q(f(X2)) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] : q(f(X2))
=> ? [X3,X4] :
( q(X3)
& ( p(f(X4))
=> ( ( r(X4)
=> ( r(X1)
& r(X0) ) )
& p(X3) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
( ! [X2] : q(f(X2))
=> ? [X3,X4] :
( q(X3)
& ( p(f(X4))
=> ( ( r(X4)
=> ( r(X1)
& r(X0) ) )
& p(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f14,plain,
! [X2,X3] :
( ~ q(X2)
| p(f(X3)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f22,plain,
! [X0] : ~ p(f(X0)),
inference(resolution,[],[f21,f17]) ).
fof(f17,plain,
! [X0,X1] : sP0(sK2,sK1,X0,f(X1)),
inference(resolution,[],[f15,f13]) ).
fof(f15,plain,
! [X2,X3] :
( ~ q(X2)
| sP0(sK2,sK1,X3,X2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f21,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ~ p(X3) ),
inference(subsumption_resolution,[],[f20,f19]) ).
fof(f19,plain,
! [X1] : r(X1),
inference(subsumption_resolution,[],[f18,f16]) ).
fof(f18,plain,
! [X0,X1] :
( ~ p(f(X0))
| r(X1) ),
inference(resolution,[],[f11,f17]) ).
fof(f11,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ~ p(X3)
| r(X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
! [X0,X1,X2,X3] :
( ( ( ~ r(X0)
| ~ r(X1) )
& r(X2) )
| ~ p(X3)
| ~ sP0(X0,X1,X2,X3) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
! [X1,X0,X4,X3] :
( ( ( ~ r(X1)
| ~ r(X0) )
& r(X4) )
| ~ p(X3)
| ~ sP0(X1,X0,X4,X3) ),
inference(nnf_transformation,[],[f4]) ).
fof(f20,plain,
! [X2,X3,X0,X1] :
( ~ r(X1)
| ~ p(X3)
| ~ sP0(X0,X1,X2,X3) ),
inference(subsumption_resolution,[],[f12,f19]) ).
fof(f12,plain,
! [X2,X3,X0,X1] :
( ~ r(X0)
| ~ r(X1)
| ~ p(X3)
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN940+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n017.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.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 01:27:48 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (8658)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.37 % (8661)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.21/0.37 % (8659)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.21/0.37 % (8662)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.21/0.37 % (8663)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.21/0.37 % (8664)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.21/0.37 % (8665)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.21/0.38 Detected minimum model sizes of [1,1,1]
% 0.21/0.38 TRYING [1]
% 0.21/0.38 Detected maximum model sizes of [max,max,2]
% 0.21/0.38 TRYING [1,1,1]
% 0.21/0.38 % (8663)First to succeed.
% 0.21/0.38 TRYING [2]
% 0.21/0.38 TRYING [2,1,1]
% 0.21/0.38 TRYING [1]
% 0.21/0.38 TRYING [2,1,2]
% 0.21/0.38 TRYING [2]
% 0.21/0.38 Cannot enumerate next child to try in an incomplete setup
% 0.21/0.38 % (8662)Refutation not found, incomplete strategy% (8662)------------------------------
% 0.21/0.38 % (8662)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.38 % (8662)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38
% 0.21/0.38 % (8662)Memory used [KB]: 725
% 0.21/0.38 % (8662)Time elapsed: 0.003 s
% 0.21/0.38 % (8662)Instructions burned: 3 (million)
% 0.21/0.38 % (8662)------------------------------
% 0.21/0.38 % (8662)------------------------------
% 0.21/0.38 % (8659)Also succeeded, but the first one will report.
% 0.21/0.38 % (8663)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (8663)------------------------------
% 0.21/0.38 % (8663)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.38 % (8663)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (8663)Memory used [KB]: 733
% 0.21/0.38 % (8663)Time elapsed: 0.003 s
% 0.21/0.38 % (8663)Instructions burned: 3 (million)
% 0.21/0.38 % (8663)------------------------------
% 0.21/0.38 % (8663)------------------------------
% 0.21/0.38 % (8658)Success in time 0.008 s
%------------------------------------------------------------------------------