TSTP Solution File: SYN083+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN083+1 : TPTP v8.1.0. Released v2.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 : n026.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 19:25:30 EDT 2022
% Result : Theorem 0.20s 0.58s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 15 unt; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 11 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 24 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,plain,
$false,
inference(trivial_inequality_removal,[],[f16]) ).
fof(f16,plain,
f(sK1,f(sK0,f(sK2,sK3))) != f(sK1,f(sK0,f(sK2,sK3))),
inference(forward_demodulation,[],[f15,f12]) ).
fof(f12,plain,
! [X2,X0,X1] : f(X0,f(X1,X2)) = f(f(X0,X1),X2),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1,X2] : f(X0,f(X1,X2)) = f(f(X0,X1),X2),
inference(rectify,[],[f5]) ).
fof(f5,plain,
! [X1,X0,X2] : f(X1,f(X0,X2)) = f(f(X1,X0),X2),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0,X2] : f(X0,f(X1,X2)) = f(f(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p61_1) ).
fof(f15,plain,
f(sK1,f(sK0,f(sK2,sK3))) != f(sK1,f(f(sK0,sK2),sK3)),
inference(superposition,[],[f13,f12]) ).
fof(f13,plain,
f(f(sK1,f(sK0,sK2)),sK3) != f(sK1,f(sK0,f(sK2,sK3))),
inference(backward_demodulation,[],[f11,f12]) ).
fof(f11,plain,
f(sK1,f(sK0,f(sK2,sK3))) != f(f(f(sK1,sK0),sK2),sK3),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
f(sK1,f(sK0,f(sK2,sK3))) != f(f(f(sK1,sK0),sK2),sK3),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f8]) ).
fof(f8,plain,
( ? [X0,X1,X2,X3] : f(X1,f(X0,f(X2,X3))) != f(f(f(X1,X0),X2),X3)
=> f(sK1,f(sK0,f(sK2,sK3))) != f(f(f(sK1,sK0),sK2),sK3) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
? [X0,X1,X2,X3] : f(X1,f(X0,f(X2,X3))) != f(f(f(X1,X0),X2),X3),
inference(rectify,[],[f6]) ).
fof(f6,plain,
? [X2,X0,X1,X3] : f(f(f(X0,X2),X1),X3) != f(X0,f(X2,f(X1,X3))),
inference(ennf_transformation,[],[f4]) ).
fof(f4,plain,
~ ! [X2,X3,X1,X0] : f(f(f(X0,X2),X1),X3) = f(X0,f(X2,f(X1,X3))),
inference(rectify,[],[f3]) ).
fof(f3,negated_conjecture,
~ ! [X0,X2,X1,X3] : f(X0,f(X1,f(X2,X3))) = f(f(f(X0,X1),X2),X3),
inference(negated_conjecture,[],[f2]) ).
fof(f2,conjecture,
! [X0,X2,X1,X3] : f(X0,f(X1,f(X2,X3))) = f(f(f(X0,X1),X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel61) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN083+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/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.34 % Computer : n026.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 : Tue Aug 30 21:43:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.56 % (6437)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.56 % (6451)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.57 % (6443)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.57 % (6437)First to succeed.
% 0.20/0.58 % (6437)Refutation found. Thanks to Tanya!
% 0.20/0.58 % SZS status Theorem for theBenchmark
% 0.20/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.58 % (6437)------------------------------
% 0.20/0.58 % (6437)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58 % (6437)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (6437)Termination reason: Refutation
% 0.20/0.58
% 0.20/0.58 % (6437)Memory used [KB]: 5884
% 0.20/0.58 % (6437)Time elapsed: 0.145 s
% 0.20/0.58 % (6437)Instructions burned: 1 (million)
% 0.20/0.58 % (6437)------------------------------
% 0.20/0.58 % (6437)------------------------------
% 0.20/0.58 % (6432)Success in time 0.225 s
%------------------------------------------------------------------------------