TSTP Solution File: REL049+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : REL049+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 : n029.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:13:24 EDT 2022
% Result : Theorem 0.23s 0.53s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 14 unt; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 31 ( 12 ~; 0 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 27 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f62,plain,
$false,
inference(subsumption_resolution,[],[f61,f39]) ).
fof(f39,plain,
join(sK1,sK0) = sK0,
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
( join(sK1,sK0) = sK0
& join(join(sK2,sK1),sK0) != sK0
& join(sK2,sK0) = sK0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f26,f27]) ).
fof(f27,plain,
( ? [X0,X1,X2] :
( join(X1,X0) = X0
& join(join(X2,X1),X0) != X0
& join(X2,X0) = X0 )
=> ( join(sK1,sK0) = sK0
& join(join(sK2,sK1),sK0) != sK0
& join(sK2,sK0) = sK0 ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
? [X0,X1,X2] :
( join(X1,X0) = X0
& join(join(X2,X1),X0) != X0
& join(X2,X0) = X0 ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
? [X2,X1,X0] :
( join(X1,X2) = X2
& join(join(X0,X1),X2) != X2
& join(X0,X2) = X2 ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
? [X0,X1,X2] :
( join(join(X0,X1),X2) != X2
& join(X1,X2) = X2
& join(X0,X2) = X2 ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X0,X1,X2] :
( ( join(X1,X2) = X2
& join(X0,X2) = X2 )
=> join(join(X0,X1),X2) = X2 ),
inference(rectify,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X0,X2,X1] :
( ( join(X2,X1) = X1
& join(X0,X1) = X1 )
=> join(join(X0,X2),X1) = X1 ),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X0,X2,X1] :
( ( join(X2,X1) = X1
& join(X0,X1) = X1 )
=> join(join(X0,X2),X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f61,plain,
join(sK1,sK0) != sK0,
inference(forward_demodulation,[],[f58,f37]) ).
fof(f37,plain,
join(sK2,sK0) = sK0,
inference(cnf_transformation,[],[f28]) ).
fof(f58,plain,
join(sK1,join(sK2,sK0)) != sK0,
inference(superposition,[],[f46,f41]) ).
fof(f41,plain,
! [X2,X0,X1] : join(join(X0,X2),X1) = join(X0,join(X2,X1)),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1,X2] : join(join(X0,X2),X1) = join(X0,join(X2,X1)),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X2,X0,X1] : join(X2,join(X1,X0)) = join(join(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2,X1,X0] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maddux2_join_associativity) ).
fof(f46,plain,
join(join(sK1,sK2),sK0) != sK0,
inference(forward_demodulation,[],[f38,f35]) ).
fof(f35,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maddux1_join_commutativity) ).
fof(f38,plain,
join(join(sK2,sK1),sK0) != sK0,
inference(cnf_transformation,[],[f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.15/0.38 % Computer : n029.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Tue Aug 30 11:46:42 EDT 2022
% 0.15/0.38 % CPUTime :
% 0.23/0.52 % (20541)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.23/0.52 % (20541)First to succeed.
% 0.23/0.53 % (20541)Refutation found. Thanks to Tanya!
% 0.23/0.53 % SZS status Theorem for theBenchmark
% 0.23/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.53 % (20541)------------------------------
% 0.23/0.53 % (20541)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.23/0.53 % (20541)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.23/0.53 % (20541)Termination reason: Refutation
% 0.23/0.53
% 0.23/0.53 % (20541)Memory used [KB]: 5884
% 0.23/0.53 % (20541)Time elapsed: 0.102 s
% 0.23/0.53 % (20541)Instructions burned: 2 (million)
% 0.23/0.53 % (20541)------------------------------
% 0.23/0.53 % (20541)------------------------------
% 0.23/0.53 % (20531)Success in time 0.14 s
%------------------------------------------------------------------------------