TSTP Solution File: NUM430+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NUM430+3 : 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_sat --cores 0 -t %d %s
% Computer : n027.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 18:05:04 EDT 2022
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 46 ( 16 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 40 ( 8 ~; 3 |; 27 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 11 ( 3 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f137,plain,
$false,
inference(subsumption_resolution,[],[f136,f107]) ).
fof(f107,plain,
aInteger0(sK0),
inference(cnf_transformation,[],[f71]) ).
fof(f71,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& aInteger0(sK0)
& sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK0)
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aInteger0(sK1)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f31,f70,f69]) ).
fof(f69,plain,
( ? [X0] :
( aInteger0(X0)
& sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc)) )
=> ( aInteger0(sK0)
& sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f70,plain,
( ? [X1] :
( aInteger0(X1)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X1) )
=> ( aInteger0(sK1)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xb,xc,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& ? [X0] :
( aInteger0(X0)
& sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc)) )
& sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ? [X1] :
( aInteger0(X1)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X1) ) ),
inference(rectify,[],[f23]) ).
fof(f23,axiom,
( sdteqdtlpzmzozddtrp0(xa,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ? [X0] :
( aInteger0(X0)
& sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc)) )
& ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) )
& sdteqdtlpzmzozddtrp0(xb,xc,xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__853) ).
fof(f136,plain,
~ aInteger0(sK0),
inference(equality_resolution,[],[f134]) ).
fof(f134,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtasdt0(xq,sK0)
| ~ aInteger0(X0) ),
inference(forward_demodulation,[],[f83,f106]) ).
fof(f106,plain,
sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK0),
inference(cnf_transformation,[],[f71]) ).
fof(f83,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0] :
( ~ aInteger0(X0)
| sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc)) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,negated_conjecture,
~ ? [X0] :
( aInteger0(X0)
& sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc)) ),
inference(negated_conjecture,[],[f25]) ).
fof(f25,conjecture,
? [X0] :
( aInteger0(X0)
& sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM430+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/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.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 06:46:31 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.47 % (5311)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.18/0.48 % (5311)First to succeed.
% 0.18/0.48 % (5311)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Theorem for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (5311)------------------------------
% 0.18/0.48 % (5311)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48 % (5311)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.48 % (5311)Termination reason: Refutation
% 0.18/0.48
% 0.18/0.48 % (5311)Memory used [KB]: 1023
% 0.18/0.48 % (5311)Time elapsed: 0.108 s
% 0.18/0.48 % (5311)Instructions burned: 4 (million)
% 0.18/0.48 % (5311)------------------------------
% 0.18/0.49 % (5311)------------------------------
% 0.18/0.49 % (5308)Success in time 0.143 s
%------------------------------------------------------------------------------