TSTP Solution File: SYN365+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN365+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 : n021.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:03:03 EDT 2024
% Result : Theorem 0.22s 0.39s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 108 ( 36 ~; 22 |; 36 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 43 ( 29 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,plain,
$false,
inference(subsumption_resolution,[],[f20,f14]) ).
fof(f14,plain,
big_p(sK0),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ! [X1] :
( ~ big_p(X1)
| ~ big_r(sK0,X1) )
& big_p(sK0)
& ! [X2] :
( ( big_p(h(X2))
& big_p(g(X2)) )
| ~ big_p(X2) )
& ! [X3] :
( ( big_p(sK1(X3))
& big_r(X3,g(h(sK1(X3)))) )
| ~ big_p(X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0] :
( ! [X1] :
( ~ big_p(X1)
| ~ big_r(X0,X1) )
& big_p(X0) )
=> ( ! [X1] :
( ~ big_p(X1)
| ~ big_r(sK0,X1) )
& big_p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X3] :
( ? [X4] :
( ( big_p(X4)
& big_r(X3,g(h(X4))) )
| ~ big_p(X3) )
=> ( ( big_p(sK1(X3))
& big_r(X3,g(h(sK1(X3)))) )
| ~ big_p(X3) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ? [X0] :
( ! [X1] :
( ~ big_p(X1)
| ~ big_r(X0,X1) )
& big_p(X0) )
& ! [X2] :
( ( big_p(h(X2))
& big_p(g(X2)) )
| ~ big_p(X2) )
& ! [X3] :
? [X4] :
( ( big_p(X4)
& big_r(X3,g(h(X4))) )
| ~ big_p(X3) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ? [X3] :
( ! [X4] :
( ~ big_p(X4)
| ~ big_r(X3,X4) )
& big_p(X3) )
& ! [X0] :
( ( big_p(h(X0))
& big_p(g(X0)) )
| ~ big_p(X0) )
& ! [X1] :
? [X2] :
( ( big_p(X2)
& big_r(X1,g(h(X2))) )
| ~ big_p(X1) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X3] :
( ! [X4] :
( ~ big_p(X4)
| ~ big_r(X3,X4) )
& big_p(X3) )
& ! [X0] :
( ( big_p(h(X0))
& big_p(g(X0)) )
| ~ big_p(X0) )
& ! [X1] :
? [X2] :
( ( big_p(X2)
& big_r(X1,g(h(X2))) )
| ~ big_p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ! [X0] :
( big_p(X0)
=> ( big_p(h(X0))
& big_p(g(X0)) ) )
& ! [X1] :
? [X2] :
( big_p(X1)
=> ( big_p(X2)
& big_r(X1,g(h(X2))) ) ) )
=> ! [X3] :
( big_p(X3)
=> ? [X4] :
( big_p(X4)
& big_r(X3,X4) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ! [X2] :
( big_p(X2)
=> ( big_p(h(X2))
& big_p(g(X2)) ) )
& ! [X0] :
? [X1] :
( big_p(X0)
=> ( big_p(X1)
& big_r(X0,g(h(X1))) ) ) )
=> ! [X0] :
( big_p(X0)
=> ? [X1] :
( big_p(X1)
& big_r(X0,X1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ! [X2] :
( big_p(X2)
=> ( big_p(h(X2))
& big_p(g(X2)) ) )
& ! [X0] :
? [X1] :
( big_p(X0)
=> ( big_p(X1)
& big_r(X0,g(h(X1))) ) ) )
=> ! [X0] :
( big_p(X0)
=> ? [X1] :
( big_p(X1)
& big_r(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2116) ).
fof(f20,plain,
~ big_p(sK0),
inference(resolution,[],[f19,f11]) ).
fof(f11,plain,
! [X3] :
( big_p(sK1(X3))
| ~ big_p(X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f19,plain,
~ big_p(sK1(sK0)),
inference(resolution,[],[f18,f13]) ).
fof(f13,plain,
! [X2] :
( big_p(h(X2))
| ~ big_p(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
~ big_p(h(sK1(sK0))),
inference(resolution,[],[f17,f12]) ).
fof(f12,plain,
! [X2] :
( big_p(g(X2))
| ~ big_p(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
~ big_p(g(h(sK1(sK0)))),
inference(subsumption_resolution,[],[f16,f14]) ).
fof(f16,plain,
( ~ big_p(sK0)
| ~ big_p(g(h(sK1(sK0)))) ),
inference(resolution,[],[f10,f15]) ).
fof(f15,plain,
! [X1] :
( ~ big_r(sK0,X1)
| ~ big_p(X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f10,plain,
! [X3] :
( big_r(X3,g(h(sK1(X3))))
| ~ big_p(X3) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN365+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 01:52:40 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.14/0.37 % (8708)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.39 % (8709)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.39 % (8710)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.39 % (8711)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.22/0.39 % (8713)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.22/0.39 % (8712)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.22/0.39 % (8714)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.22/0.39 % (8715)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.22/0.39 TRYING [1]
% 0.22/0.39 TRYING [1]
% 0.22/0.39 TRYING [2]
% 0.22/0.39 TRYING [2]
% 0.22/0.39 TRYING [1]
% 0.22/0.39 TRYING [1]
% 0.22/0.39 TRYING [3]
% 0.22/0.39 TRYING [2]
% 0.22/0.39 TRYING [3]
% 0.22/0.39 TRYING [2]
% 0.22/0.39 % (8714)First to succeed.
% 0.22/0.39 TRYING [3]
% 0.22/0.39 TRYING [3]
% 0.22/0.39 TRYING [4]
% 0.22/0.39 TRYING [4]
% 0.22/0.39 TRYING [4]
% 0.22/0.39 % (8711)Also succeeded, but the first one will report.
% 0.22/0.39 TRYING [4]
% 0.22/0.39 TRYING [5]
% 0.22/0.39 % (8713)Also succeeded, but the first one will report.
% 0.22/0.39 % (8714)Refutation found. Thanks to Tanya!
% 0.22/0.39 % SZS status Theorem for theBenchmark
% 0.22/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.39 % (8714)------------------------------
% 0.22/0.39 % (8714)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.39 % (8714)Termination reason: Refutation
% 0.22/0.39
% 0.22/0.39 % (8714)Memory used [KB]: 745
% 0.22/0.39 % (8714)Time elapsed: 0.003 s
% 0.22/0.39 % (8714)Instructions burned: 3 (million)
% 0.22/0.39 % (8714)------------------------------
% 0.22/0.39 % (8714)------------------------------
% 0.22/0.39 % (8708)Success in time 0.019 s
%------------------------------------------------------------------------------