TSTP Solution File: GRP702-12 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : GRP702-12 : TPTP v8.1.0. Released v8.1.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 : n019.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:23:52 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 19 ( 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f361,plain,
$false,
inference(subsumption_resolution,[],[f360,f19]) ).
fof(f19,plain,
sF1 != sF3,
inference(definition_folding,[],[f14,f18,f17,f16,f15]) ).
fof(f15,plain,
mult(op_d,x1) = sF0,
introduced(function_definition,[]) ).
fof(f16,plain,
sF1 = mult(x0,sF0),
introduced(function_definition,[]) ).
fof(f17,plain,
mult(x0,op_d) = sF2,
introduced(function_definition,[]) ).
fof(f18,plain,
mult(sF2,x1) = sF3,
introduced(function_definition,[]) ).
fof(f14,axiom,
mult(x0,mult(op_d,x1)) != mult(mult(x0,op_d),x1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
fof(f360,plain,
sF1 = sF3,
inference(forward_demodulation,[],[f354,f110]) ).
fof(f110,plain,
! [X2] : rd(mult(op_c,X2),op_c) = X2,
inference(forward_demodulation,[],[f99,f61]) ).
fof(f61,plain,
op_c = op_d,
inference(forward_demodulation,[],[f54,f20]) ).
fof(f20,plain,
! [X2] : ld(unit,X2) = X2,
inference(superposition,[],[f1,f6]) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
fof(f1,axiom,
! [X0,X1] : mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
fof(f54,plain,
op_d = ld(unit,op_c),
inference(superposition,[],[f11,f5]) ).
fof(f5,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f11,axiom,
! [X0] : op_d = ld(X0,mult(op_c,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
fof(f99,plain,
! [X2] : rd(mult(op_c,X2),op_d) = X2,
inference(superposition,[],[f41,f11]) ).
fof(f41,plain,
! [X2,X1] : rd(X2,ld(X1,X2)) = X1,
inference(superposition,[],[f4,f1]) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f354,plain,
rd(mult(op_c,sF1),op_c) = sF3,
inference(superposition,[],[f110,f343]) ).
fof(f343,plain,
mult(op_c,sF1) = mult(op_c,sF3),
inference(superposition,[],[f284,f323]) ).
fof(f323,plain,
mult(sF2,sF0) = mult(op_c,sF1),
inference(superposition,[],[f224,f16]) ).
fof(f224,plain,
! [X3] : mult(op_c,mult(x0,X3)) = mult(sF2,X3),
inference(superposition,[],[f8,f133]) ).
fof(f133,plain,
mult(op_c,x0) = sF2,
inference(superposition,[],[f67,f64]) ).
fof(f64,plain,
! [X0] : mult(op_c,X0) = mult(X0,op_c),
inference(forward_demodulation,[],[f59,f61]) ).
fof(f59,plain,
! [X0] : mult(op_c,X0) = mult(X0,op_d),
inference(superposition,[],[f1,f11]) ).
fof(f67,plain,
mult(x0,op_c) = sF2,
inference(superposition,[],[f17,f61]) ).
fof(f8,axiom,
! [X0,X1] : mult(op_c,mult(X0,X1)) = mult(mult(op_c,X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
fof(f284,plain,
mult(sF2,sF0) = mult(op_c,sF3),
inference(forward_demodulation,[],[f283,f83]) ).
fof(f83,plain,
mult(x1,op_c) = sF0,
inference(superposition,[],[f1,f76]) ).
fof(f76,plain,
op_c = ld(x1,sF0),
inference(forward_demodulation,[],[f73,f61]) ).
fof(f73,plain,
op_d = ld(x1,sF0),
inference(superposition,[],[f11,f68]) ).
fof(f68,plain,
mult(op_c,x1) = sF0,
inference(superposition,[],[f15,f61]) ).
fof(f283,plain,
mult(op_c,sF3) = mult(sF2,mult(x1,op_c)),
inference(forward_demodulation,[],[f267,f64]) ).
fof(f267,plain,
mult(sF2,mult(x1,op_c)) = mult(sF3,op_c),
inference(superposition,[],[f9,f18]) ).
fof(f9,axiom,
! [X0,X1] : mult(X0,mult(X1,op_c)) = mult(mult(X0,X1),op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP702-12 : TPTP v8.1.0. Released v8.1.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 : n019.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 22:49:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.48 % (26340)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.49 % (26340)First to succeed.
% 0.20/0.50 % (26346)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (26340)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (26340)------------------------------
% 0.20/0.51 % (26340)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (26340)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (26340)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (26340)Memory used [KB]: 5628
% 0.20/0.51 % (26340)Time elapsed: 0.088 s
% 0.20/0.51 % (26340)Instructions burned: 17 (million)
% 0.20/0.51 % (26340)------------------------------
% 0.20/0.51 % (26340)------------------------------
% 0.20/0.51 % (26327)Success in time 0.162 s
%------------------------------------------------------------------------------