TSTP Solution File: REL049+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n006.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:14:12 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 9 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 27 ( 10 ~; 0 |; 13 &)
% ( 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 : 27 ( 18 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f388,plain,
$false,
inference(subsumption_resolution,[],[f387,f37]) ).
fof(f37,plain,
sK2 = join(sK0,sK2),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
( join(sK1,sK2) = sK2
& sK2 = join(sK0,sK2)
& sK2 != join(join(sK0,sK1),sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f22,f25]) ).
fof(f25,plain,
( ? [X0,X1,X2] :
( join(X1,X2) = X2
& join(X0,X2) = X2
& join(join(X0,X1),X2) != X2 )
=> ( join(sK1,sK2) = sK2
& sK2 = join(sK0,sK2)
& sK2 != join(join(sK0,sK1),sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
? [X0,X1,X2] :
( join(X1,X2) = X2
& join(X0,X2) = X2
& join(join(X0,X1),X2) != X2 ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
? [X0,X2,X1] :
( join(join(X0,X1),X2) != X2
& join(X0,X2) = X2
& join(X1,X2) = X2 ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ! [X0,X2,X1] :
( ( join(X0,X2) = X2
& join(X1,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/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f387,plain,
sK2 != join(sK0,sK2),
inference(forward_demodulation,[],[f386,f38]) ).
fof(f38,plain,
join(sK1,sK2) = sK2,
inference(cnf_transformation,[],[f26]) ).
fof(f386,plain,
sK2 != join(sK0,join(sK1,sK2)),
inference(superposition,[],[f36,f34]) ).
fof(f34,plain,
! [X2,X0,X1] : join(join(X1,X2),X0) = join(X1,join(X2,X0)),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] : join(join(X1,X2),X0) = join(X1,join(X2,X0)),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux2_join_associativity) ).
fof(f36,plain,
sK2 != join(join(sK0,sK1),sK2),
inference(cnf_transformation,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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 : n006.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 11:35:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % (26042)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.47 % (26050)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.47 % (26042)Instruction limit reached!
% 0.19/0.47 % (26042)------------------------------
% 0.19/0.47 % (26042)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (26042)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47 % (26042)Termination reason: Unknown
% 0.19/0.47 % (26042)Termination phase: Naming
% 0.19/0.47
% 0.19/0.47 % (26042)Memory used [KB]: 895
% 0.19/0.47 % (26042)Time elapsed: 0.004 s
% 0.19/0.47 % (26042)Instructions burned: 2 (million)
% 0.19/0.47 % (26042)------------------------------
% 0.19/0.47 % (26042)------------------------------
% 0.19/0.50 % (26050)First to succeed.
% 0.19/0.50 % (26050)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (26050)------------------------------
% 0.19/0.50 % (26050)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (26050)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (26050)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (26050)Memory used [KB]: 5628
% 0.19/0.50 % (26050)Time elapsed: 0.089 s
% 0.19/0.50 % (26050)Instructions burned: 19 (million)
% 0.19/0.50 % (26050)------------------------------
% 0.19/0.50 % (26050)------------------------------
% 0.19/0.50 % (26033)Success in time 0.152 s
%------------------------------------------------------------------------------