TSTP Solution File: SYN326+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN326+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 : n007.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:02:51 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 94 ( 25 ~; 20 |; 32 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 39 ( 29 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f23,plain,
$false,
inference(subsumption_resolution,[],[f22,f17]) ).
fof(f17,plain,
! [X0] : ~ big_f(sK2(X0),sK2(X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0] :
( ~ big_f(sK2(X0),sK2(X0))
& big_f(X0,sK1(X0))
& ( big_h(sK2(X0))
| ( ~ big_g(X0)
& big_f(sK2(X0),X0) ) )
& ( big_f(X0,X0)
| sP0(X0,sK1(X0),sK2(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f6,f8]) ).
fof(f8,plain,
! [X0] :
( ? [X1,X2] :
( ~ big_f(X2,X2)
& big_f(X0,X1)
& ( big_h(X2)
| ( ~ big_g(X0)
& big_f(X2,X0) ) )
& ( big_f(X0,X0)
| sP0(X0,X1,X2) ) )
=> ( ~ big_f(sK2(X0),sK2(X0))
& big_f(X0,sK1(X0))
& ( big_h(sK2(X0))
| ( ~ big_g(X0)
& big_f(sK2(X0),X0) ) )
& ( big_f(X0,X0)
| sP0(X0,sK1(X0),sK2(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
! [X0] :
? [X1,X2] :
( ~ big_f(X2,X2)
& big_f(X0,X1)
& ( big_h(X2)
| ( ~ big_g(X0)
& big_f(X2,X0) ) )
& ( big_f(X0,X0)
| sP0(X0,X1,X2) ) ),
inference(definition_folding,[],[f4,f5]) ).
fof(f5,plain,
! [X0,X1,X2] :
( ( ~ big_h(X0)
& big_g(X1)
& big_f(X1,X2) )
| ~ sP0(X0,X1,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f4,plain,
! [X0] :
? [X1,X2] :
( ~ big_f(X2,X2)
& big_f(X0,X1)
& ( big_h(X2)
| ( ~ big_g(X0)
& big_f(X2,X0) ) )
& ( big_f(X0,X0)
| ( ~ big_h(X0)
& big_g(X1)
& big_f(X1,X2) ) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
! [X0] :
? [X1,X2] :
( ~ big_f(X2,X2)
& big_f(X0,X1)
& ( big_h(X2)
| ( ~ big_g(X0)
& big_f(X2,X0) ) )
& ( big_f(X0,X0)
| ( ~ big_h(X0)
& big_g(X1)
& big_f(X1,X2) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X0] :
! [X1,X2] :
( ( ( big_f(X1,X2)
=> ( big_g(X1)
=> big_h(X0) ) )
=> big_f(X0,X0) )
=> ( ( ( big_f(X2,X0)
=> big_g(X0) )
=> big_h(X2) )
=> ( big_f(X0,X1)
=> big_f(X2,X2) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X0] :
! [X1,X2] :
( ( ( big_f(X1,X2)
=> ( big_g(X1)
=> big_h(X0) ) )
=> big_f(X0,X0) )
=> ( ( ( big_f(X2,X0)
=> big_g(X0) )
=> big_h(X2) )
=> ( big_f(X0,X1)
=> big_f(X2,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_12_1) ).
fof(f22,plain,
! [X0] : big_f(sK2(sK1(sK2(X0))),sK2(sK1(sK2(X0)))),
inference(resolution,[],[f21,f20]) ).
fof(f20,plain,
! [X0] : big_h(sK2(sK1(sK2(X0)))),
inference(resolution,[],[f19,f15]) ).
fof(f15,plain,
! [X0] :
( ~ big_g(X0)
| big_h(sK2(X0)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f19,plain,
! [X0] : big_g(sK1(sK2(X0))),
inference(resolution,[],[f18,f17]) ).
fof(f18,plain,
! [X0] :
( big_f(X0,X0)
| big_g(sK1(X0)) ),
inference(resolution,[],[f11,f13]) ).
fof(f13,plain,
! [X0] :
( sP0(X0,sK1(X0),sK2(X0))
| big_f(X0,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| big_g(X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
! [X0,X1,X2] :
( ( ~ big_h(X0)
& big_g(X1)
& big_f(X1,X2) )
| ~ sP0(X0,X1,X2) ),
inference(nnf_transformation,[],[f5]) ).
fof(f21,plain,
! [X0] :
( ~ big_h(X0)
| big_f(X0,X0) ),
inference(resolution,[],[f12,f13]) ).
fof(f12,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| ~ big_h(X0) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN326+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.30 % Computer : n007.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Apr 30 01:49:33 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.31 % (12327)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.32 % (12329)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.32 % (12328)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.32 % (12332)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.32 % (12334)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.15/0.32 % (12333)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.32 % (12330)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.15/0.32 % (12331)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.32 TRYING [1,1]
% 0.15/0.32 TRYING [1]
% 0.15/0.32 TRYING [1]
% 0.15/0.32 % (12332)First to succeed.
% 0.15/0.32 TRYING [1,1]
% 0.15/0.32 TRYING [2,1]
% 0.15/0.32 TRYING [2,2]
% 0.15/0.32 TRYING [2]
% 0.15/0.32 TRYING [3,2]
% 0.15/0.32 TRYING [2]
% 0.15/0.32 % (12330)Also succeeded, but the first one will report.
% 0.15/0.32 TRYING [3]
% 0.15/0.32 TRYING [2,1]
% 0.15/0.32 TRYING [3,3]
% 0.15/0.32 TRYING [3]
% 0.15/0.32 TRYING [2,2]
% 0.15/0.32 TRYING [3,2]
% 0.15/0.32 TRYING [4,4]
% 0.15/0.32 TRYING [3,3]
% 0.15/0.32 TRYING [4]
% 0.15/0.32 % (12333)Also succeeded, but the first one will report.
% 0.15/0.32 Cannot enumerate next child to try in an incomplete setup
% 0.15/0.32 % (12332)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.32 % (12332)------------------------------
% 0.15/0.32 % (12332)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.32 % (12332)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (12332)Memory used [KB]: 732
% 0.15/0.32 % (12332)Time elapsed: 0.003 s
% 0.15/0.32 % (12332)Instructions burned: 3 (million)
% 0.15/0.32 % (12332)------------------------------
% 0.15/0.32 % (12332)------------------------------
% 0.15/0.32 % (12327)Success in time 0.016 s
%------------------------------------------------------------------------------