TSTP Solution File: ALG202+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : ALG202+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n013.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 : Wed Aug 31 15:43:36 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 11 unt; 3 typ; 0 def)
% Number of atoms : 131 ( 46 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 147 ( 49 ~; 37 |; 31 &)
% ( 0 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 65 ( 63 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_4,type,
sQ2_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_5,type,
sQ3_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_6,type,
sQ4_eqProxy: ( $real * $real ) > $o ).
fof(f105,plain,
$false,
inference(subsumption_resolution,[],[f104,f31]) ).
fof(f31,plain,
sK0 != op2(sK0,sK0),
inference(literal_reordering,[],[f26]) ).
fof(f26,plain,
sK0 != op2(sK0,sK0),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
( sorti2(sK0)
& sK0 != op2(sK0,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f15]) ).
fof(f15,plain,
( ? [X0] :
( sorti2(X0)
& op2(X0,X0) != X0 )
=> ( sorti2(sK0)
& sK0 != op2(sK0,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0] :
( sorti2(X0)
& op2(X0,X0) != X0 ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
~ ! [X0] :
( sorti2(X0)
=> op2(X0,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f104,plain,
sK0 = op2(sK0,sK0),
inference(forward_demodulation,[],[f103,f75]) ).
fof(f75,plain,
sK0 = h(j(sK0)),
inference(resolution,[],[f38,f37]) ).
fof(f37,plain,
sorti2(sK0),
inference(literal_reordering,[],[f27]) ).
fof(f27,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f16]) ).
fof(f38,plain,
! [X4] :
( ~ sorti2(X4)
| h(j(X4)) = X4 ),
inference(literal_reordering,[],[f21]) ).
fof(f21,plain,
! [X4] :
( ~ sorti2(X4)
| h(j(X4)) = X4 ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) )
& ! [X1] :
( sorti1(j(X1))
| ~ sorti2(X1) )
& ! [X2] :
( ! [X3] :
( h(op1(X2,X3)) = op2(h(X2),h(X3))
| ~ sorti1(X3) )
| ~ sorti1(X2) )
& ! [X4] :
( ~ sorti2(X4)
| h(j(X4)) = X4 )
& ! [X5] :
( sorti2(h(X5))
| ~ sorti1(X5) )
& ! [X6] :
( ! [X7] :
( ~ sorti2(X7)
| op1(j(X6),j(X7)) = j(op2(X6,X7)) )
| ~ sorti2(X6) ) ),
inference(rectify,[],[f9]) ).
fof(f9,plain,
( ! [X7] :
( j(h(X7)) = X7
| ~ sorti1(X7) )
& ! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) )
& ! [X3] :
( ! [X4] :
( op2(h(X3),h(X4)) = h(op1(X3,X4))
| ~ sorti1(X4) )
| ~ sorti1(X3) )
& ! [X2] :
( ~ sorti2(X2)
| h(j(X2)) = X2 )
& ! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) )
& ! [X5] :
( ! [X6] :
( ~ sorti2(X6)
| op1(j(X5),j(X6)) = j(op2(X5,X6)) )
| ~ sorti2(X5) ) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
( ! [X5] :
( ! [X6] :
( ~ sorti2(X6)
| op1(j(X5),j(X6)) = j(op2(X5,X6)) )
| ~ sorti2(X5) )
& ! [X7] :
( j(h(X7)) = X7
| ~ sorti1(X7) )
& ! [X2] :
( ~ sorti2(X2)
| h(j(X2)) = X2 )
& ! [X3] :
( ! [X4] :
( op2(h(X3),h(X4)) = h(op1(X3,X4))
| ~ sorti1(X4) )
| ~ sorti1(X3) )
& ! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) )
& ! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X0] :
( sorti2(X0)
=> sorti1(j(X0)) ) )
=> ~ ( ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> op1(j(X5),j(X6)) = j(op2(X5,X6)) ) )
& ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X2] :
( sorti2(X2)
=> h(j(X2)) = X2 )
& ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> op2(h(X3),h(X4)) = h(op1(X3,X4)) ) ) ) ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 ) ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f103,plain,
op2(sK0,h(j(sK0))) = h(j(sK0)),
inference(forward_demodulation,[],[f102,f78]) ).
fof(f78,plain,
op1(j(sK0),j(sK0)) = j(sK0),
inference(resolution,[],[f34,f70]) ).
fof(f70,plain,
sorti1(j(sK0)),
inference(resolution,[],[f29,f37]) ).
fof(f29,plain,
! [X1] :
( ~ sorti2(X1)
| sorti1(j(X1)) ),
inference(literal_reordering,[],[f23]) ).
fof(f23,plain,
! [X1] :
( sorti1(j(X1))
| ~ sorti2(X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f34,plain,
! [X0] :
( ~ sorti1(X0)
| op1(X0,X0) = X0 ),
inference(literal_reordering,[],[f25]) ).
fof(f25,plain,
! [X0] :
( ~ sorti1(X0)
| op1(X0,X0) = X0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0] :
( op1(X0,X0) = X0
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( sorti1(X0)
=> op1(X0,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f102,plain,
op2(sK0,h(j(sK0))) = h(op1(j(sK0),j(sK0))),
inference(resolution,[],[f100,f70]) ).
fof(f100,plain,
! [X0] :
( ~ sorti1(X0)
| h(op1(j(sK0),X0)) = op2(sK0,h(X0)) ),
inference(forward_demodulation,[],[f84,f75]) ).
fof(f84,plain,
! [X0] :
( ~ sorti1(X0)
| h(op1(j(sK0),X0)) = op2(h(j(sK0)),h(X0)) ),
inference(resolution,[],[f33,f70]) ).
fof(f33,plain,
! [X2,X3] :
( ~ sorti1(X2)
| h(op1(X2,X3)) = op2(h(X2),h(X3))
| ~ sorti1(X3) ),
inference(literal_reordering,[],[f22]) ).
fof(f22,plain,
! [X2,X3] :
( h(op1(X2,X3)) = op2(h(X2),h(X3))
| ~ sorti1(X3)
| ~ sorti1(X2) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG202+1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n013.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 Aug 29 14:55:02 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.51 % (10913)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.51 % (10909)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (10926)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.52 % (10903)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (10917)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.52 TRYING [1]
% 0.20/0.52 % (10900)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.52 % (10926)First to succeed.
% 0.20/0.52 TRYING [1]
% 0.20/0.53 TRYING [2]
% 0.20/0.53 TRYING [2]
% 0.20/0.53 TRYING [3]
% 0.20/0.53 % (10904)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 TRYING [3]
% 0.20/0.53 % (10921)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.53 % (10905)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.53 TRYING [4]
% 0.20/0.53 % (10926)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (10926)------------------------------
% 0.20/0.53 % (10926)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (10926)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (10926)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (10926)Memory used [KB]: 5756
% 0.20/0.53 % (10926)Time elapsed: 0.007 s
% 0.20/0.53 % (10926)Instructions burned: 5 (million)
% 0.20/0.53 % (10926)------------------------------
% 0.20/0.53 % (10926)------------------------------
% 0.20/0.53 % (10897)Success in time 0.177 s
%------------------------------------------------------------------------------