TSTP Solution File: REL003+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : REL003+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 : n013.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:29 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 19 unt; 0 def)
% Number of atoms : 93 ( 66 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 76 ( 30 ~; 26 |; 11 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 23 ( 19 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f138,plain,
$false,
inference(avatar_sat_refutation,[],[f62,f63,f125,f137]) ).
fof(f137,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_contradiction_clause,[],[f136]) ).
fof(f136,plain,
( $false
| ~ spl6_1
| spl6_2 ),
inference(subsumption_resolution,[],[f135,f61]) ).
fof(f61,plain,
( sF5 != sF4
| spl6_2 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f59,plain,
( spl6_2
<=> sF5 = sF4 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f135,plain,
( sF5 = sF4
| ~ spl6_1 ),
inference(forward_demodulation,[],[f134,f49]) ).
fof(f49,plain,
sF4 = converse(sK0),
introduced(function_definition,[]) ).
fof(f134,plain,
( sF5 = converse(sK0)
| ~ spl6_1 ),
inference(backward_demodulation,[],[f130,f56]) ).
fof(f56,plain,
( sK0 = sF2
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f55,plain,
( spl6_1
<=> sK0 = sF2 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f130,plain,
converse(sF2) = sF5,
inference(backward_demodulation,[],[f108,f50]) ).
fof(f50,plain,
sF5 = join(sF3,sF4),
introduced(function_definition,[]) ).
fof(f108,plain,
converse(sF2) = join(sF3,sF4),
inference(superposition,[],[f107,f39]) ).
fof(f39,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f24]) ).
fof(f24,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(f107,plain,
converse(sF2) = join(sF4,sF3),
inference(forward_demodulation,[],[f101,f73]) ).
fof(f73,plain,
sF2 = join(sK0,sK1),
inference(superposition,[],[f39,f46]) ).
fof(f46,plain,
join(sK1,sK0) = sF2,
introduced(function_definition,[]) ).
fof(f101,plain,
join(sF4,sF3) = converse(join(sK0,sK1)),
inference(superposition,[],[f75,f48]) ).
fof(f48,plain,
converse(sK1) = sF3,
introduced(function_definition,[]) ).
fof(f75,plain,
! [X2] : converse(join(sK0,X2)) = join(sF4,converse(X2)),
inference(superposition,[],[f29,f49]) ).
fof(f29,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',converse_additivity) ).
fof(f125,plain,
( spl6_1
| ~ spl6_2 ),
inference(avatar_contradiction_clause,[],[f124]) ).
fof(f124,plain,
( $false
| spl6_1
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f123,f57]) ).
fof(f57,plain,
( sK0 != sF2
| spl6_1 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f123,plain,
( sK0 = sF2
| ~ spl6_2 ),
inference(forward_demodulation,[],[f122,f67]) ).
fof(f67,plain,
converse(sF4) = sK0,
inference(superposition,[],[f35,f49]) ).
fof(f35,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',converse_idempotence) ).
fof(f122,plain,
( converse(sF4) = sF2
| ~ spl6_2 ),
inference(superposition,[],[f35,f112]) ).
fof(f112,plain,
( converse(sF2) = sF4
| ~ spl6_2 ),
inference(forward_demodulation,[],[f108,f65]) ).
fof(f65,plain,
( sF4 = join(sF3,sF4)
| ~ spl6_2 ),
inference(backward_demodulation,[],[f50,f60]) ).
fof(f60,plain,
( sF5 = sF4
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f63,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f51,f59,f55]) ).
fof(f51,plain,
( sF5 = sF4
| sK0 = sF2 ),
inference(definition_folding,[],[f43,f49,f50,f49,f48,f46]) ).
fof(f43,plain,
( join(sK1,sK0) = sK0
| join(converse(sK1),converse(sK0)) = converse(sK0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( ( join(sK1,sK0) = sK0
& join(converse(sK1),converse(sK0)) != converse(sK0) )
| ( join(sK1,sK0) != sK0
& join(converse(sK1),converse(sK0)) = converse(sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f21,f26]) ).
fof(f26,plain,
( ? [X0,X1] :
( ( join(X1,X0) = X0
& converse(X0) != join(converse(X1),converse(X0)) )
| ( join(X1,X0) != X0
& converse(X0) = join(converse(X1),converse(X0)) ) )
=> ( ( join(sK1,sK0) = sK0
& join(converse(sK1),converse(sK0)) != converse(sK0) )
| ( join(sK1,sK0) != sK0
& join(converse(sK1),converse(sK0)) = converse(sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1] :
( ( join(X1,X0) = X0
& converse(X0) != join(converse(X1),converse(X0)) )
| ( join(X1,X0) != X0
& converse(X0) = join(converse(X1),converse(X0)) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ! [X1,X0] :
( ( join(X1,X0) = X0
=> converse(X0) = join(converse(X1),converse(X0)) )
& ( converse(X0) = join(converse(X1),converse(X0))
=> join(X1,X0) = X0 ) ),
inference(rectify,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X1,X0] :
( ( converse(X1) = join(converse(X0),converse(X1))
=> join(X0,X1) = X1 )
& ( join(X0,X1) = X1
=> converse(X1) = join(converse(X0),converse(X1)) ) ),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X1,X0] :
( ( converse(X1) = join(converse(X0),converse(X1))
=> join(X0,X1) = X1 )
& ( join(X0,X1) = X1
=> converse(X1) = join(converse(X0),converse(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f62,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f52,f59,f55]) ).
fof(f52,plain,
( sF5 != sF4
| sK0 != sF2 ),
inference(definition_folding,[],[f42,f46,f49,f50,f49,f48]) ).
fof(f42,plain,
( join(converse(sK1),converse(sK0)) != converse(sK0)
| join(sK1,sK0) != sK0 ),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL003+1 : TPTP v8.1.0. Released v4.0.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.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 11:08:17 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (25329)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 % (25329)First to succeed.
% 0.20/0.50 % (25346)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (25339)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.51 % (25328)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (25340)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52 % (25329)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (25329)------------------------------
% 0.20/0.52 % (25329)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (25329)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (25329)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (25329)Memory used [KB]: 5500
% 0.20/0.52 % (25329)Time elapsed: 0.101 s
% 0.20/0.52 % (25329)Instructions burned: 7 (million)
% 0.20/0.52 % (25329)------------------------------
% 0.20/0.52 % (25329)------------------------------
% 0.20/0.52 % (25322)Success in time 0.161 s
%------------------------------------------------------------------------------