TSTP Solution File: SYN941+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN941+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 : n002.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:18:28 EDT 2024
% Result : Theorem 0.21s 0.37s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 90 ( 36 ~; 27 |; 20 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 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 : 60 ( 50 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,plain,
$false,
inference(subsumption_resolution,[],[f21,f15]) ).
fof(f15,plain,
! [X0] : p(f(X0)),
inference(resolution,[],[f13,f12]) ).
fof(f12,plain,
q(f(sK1)),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ! [X2,X3] :
( ~ q(X2)
| ( sP0(sK2,sK1,X3,X2)
& p(f(X3)) ) )
& q(f(sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f5,f8]) ).
fof(f8,plain,
( ? [X0,X1] :
( ! [X2,X3] :
( ~ q(X2)
| ( sP0(X1,X0,X3,X2)
& p(f(X3)) ) )
& q(f(X0)) )
=> ( ! [X3,X2] :
( ~ q(X2)
| ( sP0(sK2,sK1,X3,X2)
& p(f(X3)) ) )
& q(f(sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ q(X2)
| ( sP0(X1,X0,X3,X2)
& p(f(X3)) ) )
& q(f(X0)) ),
inference(definition_folding,[],[f3,f4]) ).
fof(f4,plain,
! [X1,X0,X3,X2] :
( ( ( ~ r(X1)
| ~ r(X0) )
& r(X3) )
| ~ p(X2)
| ~ sP0(X1,X0,X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f3,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ q(X2)
| ( ( ( ( ~ r(X1)
| ~ r(X0) )
& r(X3) )
| ~ p(X2) )
& p(f(X3)) ) )
& q(f(X0)) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( q(f(X0))
=> ? [X2,X3] :
( q(X2)
& ( p(f(X3))
=> ( ( r(X3)
=> ( r(X1)
& r(X0) ) )
& p(X2) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
( q(f(X0))
=> ? [X2,X3] :
( q(X2)
& ( p(f(X3))
=> ( ( r(X3)
=> ( r(X1)
& r(X0) ) )
& p(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f13,plain,
! [X2,X3] :
( ~ q(X2)
| p(f(X3)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f21,plain,
~ p(f(sK1)),
inference(resolution,[],[f20,f16]) ).
fof(f16,plain,
! [X0] : sP0(sK2,sK1,X0,f(sK1)),
inference(resolution,[],[f14,f12]) ).
fof(f14,plain,
! [X2,X3] :
( ~ q(X2)
| sP0(sK2,sK1,X3,X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f20,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ~ p(X3) ),
inference(subsumption_resolution,[],[f19,f18]) ).
fof(f18,plain,
! [X0] : r(X0),
inference(subsumption_resolution,[],[f17,f15]) ).
fof(f17,plain,
! [X0] :
( ~ p(f(sK1))
| r(X0) ),
inference(resolution,[],[f10,f16]) ).
fof(f10,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,X3,X2] :
( ( ( ~ r(X1)
| ~ r(X0) )
& r(X3) )
| ~ p(X2)
| ~ sP0(X1,X0,X3,X2) ),
inference(nnf_transformation,[],[f4]) ).
fof(f19,plain,
! [X2,X3,X0,X1] :
( ~ r(X1)
| ~ p(X3)
| ~ sP0(X0,X1,X2,X3) ),
inference(subsumption_resolution,[],[f11,f18]) ).
fof(f11,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 : SYN941+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.34 % Computer : n002.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Fri May 3 17:49:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 % (20630)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.37 % (20636)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.21/0.37 % (20632)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.37 % (20634)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 % (20637)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.37 % (20633)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 % (20635)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.21/0.37 % (20631)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.21/0.37 Detected minimum model sizes of [1,1]
% 0.21/0.37 Detected minimum model sizes of [1,1]
% 0.21/0.37 Detected maximum model sizes of [max,2]
% 0.21/0.37 TRYING [1]
% 0.21/0.37 Detected maximum model sizes of [max,2]
% 0.21/0.37 TRYING [1,1]
% 0.21/0.37 TRYING [1,1]
% 0.21/0.37 TRYING [1]
% 0.21/0.37 % (20635)First to succeed.
% 0.21/0.37 % (20636)Also succeeded, but the first one will report.
% 0.21/0.37 % (20633)Also succeeded, but the first one will report.
% 0.21/0.37 TRYING [2]
% 0.21/0.37 TRYING [2,1]
% 0.21/0.37 % (20635)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20630"
% 0.21/0.37 TRYING [2,1]
% 0.21/0.37 TRYING [2,2]
% 0.21/0.37 TRYING [2,2]
% 0.21/0.37 TRYING [2]
% 0.21/0.37 Cannot enumerate next child to try in an incomplete setup
% 0.21/0.37 TRYING [3]
% 0.21/0.37 Cannot enumerate next child to try in an incomplete setup
% 0.21/0.37 % (20634)Refutation not found, incomplete strategy% (20634)------------------------------
% 0.21/0.37 % (20634)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.37 % (20634)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.37
% 0.21/0.37 % (20634)Memory used [KB]: 726
% 0.21/0.37 % (20634)Time elapsed: 0.004 s
% 0.21/0.37 % (20634)Instructions burned: 3 (million)
% 0.21/0.37 % (20632)Refutation not found, incomplete strategy% (20632)------------------------------
% 0.21/0.37 % (20632)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.37 % (20632)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.37
% 0.21/0.37 % (20631)Also succeeded, but the first one will report.
% 0.21/0.37 % (20632)Memory used [KB]: 726
% 0.21/0.37 % (20632)Time elapsed: 0.004 s
% 0.21/0.37 % (20632)Instructions burned: 3 (million)
% 0.21/0.37 % (20637)Also succeeded, but the first one will report.
% 0.21/0.37 % (20634)------------------------------
% 0.21/0.37 % (20634)------------------------------
% 0.21/0.37 % (20632)------------------------------
% 0.21/0.37 % (20632)------------------------------
% 0.21/0.37 % (20635)Refutation found. Thanks to Tanya!
% 0.21/0.37 % SZS status Theorem for theBenchmark
% 0.21/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.37 % (20635)------------------------------
% 0.21/0.37 % (20635)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.37 % (20635)Termination reason: Refutation
% 0.21/0.37
% 0.21/0.37 % (20635)Memory used [KB]: 733
% 0.21/0.37 % (20635)Time elapsed: 0.003 s
% 0.21/0.37 % (20635)Instructions burned: 3 (million)
% 0.21/0.37 % (20630)Success in time 0.008 s
%------------------------------------------------------------------------------