TSTP Solution File: GRP711+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : GRP711+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n011.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 16:18:23 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 56 ( 28 unt; 0 def)
% Number of atoms : 104 ( 76 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 79 ( 31 ~; 25 |; 13 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 52 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f536,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f38,f529,f535]) ).
fof(f535,plain,
( ~ spl3_1
| spl3_3 ),
inference(avatar_contradiction_clause,[],[f534]) ).
fof(f534,plain,
( $false
| ~ spl3_1
| spl3_3 ),
inference(subsumption_resolution,[],[f533,f36]) ).
fof(f36,plain,
( sK1 != sK0
| spl3_3 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f34,plain,
( spl3_3
<=> sK1 = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f533,plain,
( sK1 = sK0
| ~ spl3_1 ),
inference(forward_demodulation,[],[f530,f83]) ).
fof(f83,plain,
! [X6,X7] : mult(i(mult(X6,X6)),mult(X6,mult(X6,X7))) = X7,
inference(forward_demodulation,[],[f78,f14]) ).
fof(f14,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f78,plain,
! [X6,X7] : mult(i(mult(X6,X6)),mult(X6,mult(X6,X7))) = mult(unit,X7),
inference(superposition,[],[f65,f21]) ).
fof(f21,plain,
! [X0] : unit = mult(i(X0),X0),
inference(cnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] : unit = mult(i(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f65,plain,
! [X2,X0,X1] : mult(X1,mult(X0,mult(X0,X2))) = mult(mult(X1,mult(X0,X0)),X2),
inference(backward_demodulation,[],[f16,f64]) ).
fof(f64,plain,
! [X0,X1] : mult(X0,mult(X1,X1)) = mult(mult(X0,X1),X1),
inference(forward_demodulation,[],[f56,f15]) ).
fof(f15,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f56,plain,
! [X0,X1] : mult(X0,mult(X1,mult(X1,unit))) = mult(mult(X0,X1),X1),
inference(superposition,[],[f15,f16]) ).
fof(f16,plain,
! [X2,X0,X1] : mult(X1,mult(X0,mult(X0,X2))) = mult(mult(mult(X1,X0),X0),X2),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1,X2] : mult(X1,mult(X0,mult(X0,X2))) = mult(mult(mult(X1,X0),X0),X2),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X2,X0,X1] : mult(X0,mult(X2,mult(X2,X1))) = mult(mult(mult(X0,X2),X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(f530,plain,
( sK1 = mult(i(mult(sK2,sK2)),mult(sK2,mult(sK2,sK0)))
| ~ spl3_1 ),
inference(superposition,[],[f83,f27]) ).
fof(f27,plain,
( mult(sK2,sK1) = mult(sK2,sK0)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f25,plain,
( spl3_1
<=> mult(sK2,sK1) = mult(sK2,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f529,plain,
( ~ spl3_2
| spl3_3 ),
inference(avatar_contradiction_clause,[],[f528]) ).
fof(f528,plain,
( $false
| ~ spl3_2
| spl3_3 ),
inference(subsumption_resolution,[],[f519,f36]) ).
fof(f519,plain,
( sK1 = sK0
| ~ spl3_2 ),
inference(superposition,[],[f400,f15]) ).
fof(f400,plain,
( sK0 = mult(sK1,unit)
| ~ spl3_2 ),
inference(forward_demodulation,[],[f399,f15]) ).
fof(f399,plain,
( mult(sK1,unit) = mult(sK0,unit)
| ~ spl3_2 ),
inference(forward_demodulation,[],[f396,f22]) ).
fof(f22,plain,
! [X0] : unit = mult(X0,i(X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] : unit = mult(X0,i(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(f396,plain,
( mult(sK0,mult(sK2,i(sK2))) = mult(sK1,mult(sK2,i(sK2)))
| ~ spl3_2 ),
inference(superposition,[],[f61,f321]) ).
fof(f321,plain,
! [X2] : i(X2) = mult(X2,i(mult(X2,X2))),
inference(forward_demodulation,[],[f320,f15]) ).
fof(f320,plain,
! [X2] : mult(i(X2),unit) = mult(X2,i(mult(X2,X2))),
inference(forward_demodulation,[],[f293,f313]) ).
fof(f313,plain,
! [X1] : mult(X1,i(mult(X1,mult(X1,X1)))) = i(mult(X1,X1)),
inference(forward_demodulation,[],[f292,f15]) ).
fof(f292,plain,
! [X1] : mult(X1,i(mult(X1,mult(X1,X1)))) = mult(i(mult(X1,X1)),unit),
inference(superposition,[],[f83,f68]) ).
fof(f68,plain,
! [X2,X3] : unit = mult(X2,mult(X3,mult(X3,i(mult(X2,mult(X3,X3)))))),
inference(forward_demodulation,[],[f57,f64]) ).
fof(f57,plain,
! [X2,X3] : unit = mult(X2,mult(X3,mult(X3,i(mult(mult(X2,X3),X3))))),
inference(superposition,[],[f22,f16]) ).
fof(f293,plain,
! [X2] : mult(i(X2),unit) = mult(X2,mult(X2,i(mult(X2,mult(X2,X2))))),
inference(superposition,[],[f70,f68]) ).
fof(f70,plain,
! [X10,X11] : mult(i(X10),mult(X10,mult(X10,X11))) = mult(X10,X11),
inference(forward_demodulation,[],[f50,f14]) ).
fof(f50,plain,
! [X10,X11] : mult(mult(unit,X10),X11) = mult(i(X10),mult(X10,mult(X10,X11))),
inference(superposition,[],[f16,f21]) ).
fof(f61,plain,
( ! [X12] : mult(sK0,mult(sK2,mult(sK2,X12))) = mult(sK1,mult(sK2,mult(sK2,X12)))
| ~ spl3_2 ),
inference(forward_demodulation,[],[f51,f16]) ).
fof(f51,plain,
( ! [X12] : mult(sK1,mult(sK2,mult(sK2,X12))) = mult(mult(mult(sK0,sK2),sK2),X12)
| ~ spl3_2 ),
inference(superposition,[],[f16,f31]) ).
fof(f31,plain,
( mult(sK1,sK2) = mult(sK0,sK2)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl3_2
<=> mult(sK1,sK2) = mult(sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f38,plain,
~ spl3_3,
inference(avatar_split_clause,[],[f23,f34]) ).
fof(f23,plain,
sK1 != sK0,
inference(duplicate_literal_removal,[],[f17]) ).
fof(f17,plain,
( sK1 != sK0
| sK1 != sK0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
( ( mult(sK2,sK1) = mult(sK2,sK0)
& sK1 != sK0 )
| ( mult(sK1,sK2) = mult(sK0,sK2)
& sK1 != sK0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f11,f12]) ).
fof(f12,plain,
( ? [X0,X1,X2] :
( ( mult(X2,X1) = mult(X2,X0)
& X0 != X1 )
| ( mult(X0,X2) = mult(X1,X2)
& X0 != X1 ) )
=> ( ( mult(sK2,sK1) = mult(sK2,sK0)
& sK1 != sK0 )
| ( mult(sK1,sK2) = mult(sK0,sK2)
& sK1 != sK0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0,X1,X2] :
( ( mult(X2,X1) = mult(X2,X0)
& X0 != X1 )
| ( mult(X0,X2) = mult(X1,X2)
& X0 != X1 ) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
? [X0,X2,X1] :
( ( mult(X1,X2) = mult(X1,X0)
& X0 != X2 )
| ( mult(X2,X1) = mult(X0,X1)
& X0 != X2 ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X2,X1,X0] :
( ( mult(X2,X1) = mult(X0,X1)
=> X0 = X2 )
& ( mult(X1,X2) = mult(X1,X0)
=> X0 = X2 ) ),
inference(rectify,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X4,X3,X5] :
( ( mult(X3,X4) = mult(X3,X5)
=> X4 = X5 )
& ( mult(X4,X3) = mult(X5,X3)
=> X4 = X5 ) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X4,X3,X5] :
( ( mult(X3,X4) = mult(X3,X5)
=> X4 = X5 )
& ( mult(X4,X3) = mult(X5,X3)
=> X4 = X5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f32,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f20,f29,f25]) ).
fof(f20,plain,
( mult(sK1,sK2) = mult(sK0,sK2)
| mult(sK2,sK1) = mult(sK2,sK0) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP711+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 29 22:44:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.45 % (8316)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.51 % (8314)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.51 % (8306)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51 % (8316)First to succeed.
% 0.19/0.52 % (8298)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.52 % (8316)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (8316)------------------------------
% 0.19/0.52 % (8316)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (8316)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (8316)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (8316)Memory used [KB]: 6396
% 0.19/0.52 % (8316)Time elapsed: 0.101 s
% 0.19/0.52 % (8316)Instructions burned: 28 (million)
% 0.19/0.52 % (8316)------------------------------
% 0.19/0.52 % (8316)------------------------------
% 0.19/0.52 % (8290)Success in time 0.163 s
%------------------------------------------------------------------------------