TSTP Solution File: SEU219+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU219+1 : TPTP v8.1.0. Released v3.3.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 : n018.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:27:35 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 6 unt; 0 def)
% Number of atoms : 121 ( 40 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 136 ( 55 ~; 49 |; 22 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 13 ( 10 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f85,plain,
$false,
inference(avatar_sat_refutation,[],[f56,f75,f84]) ).
fof(f84,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f83]) ).
fof(f83,plain,
( $false
| spl3_2 ),
inference(subsumption_resolution,[],[f82,f36]) ).
fof(f36,plain,
relation(sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( relation(sK0)
& one_to_one(sK0)
& function(sK0)
& ( relation_dom(function_inverse(sK0)) != relation_rng(sK0)
| relation_dom(sK0) != relation_rng(function_inverse(sK0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f22,f24]) ).
fof(f24,plain,
( ? [X0] :
( relation(X0)
& one_to_one(X0)
& function(X0)
& ( relation_rng(X0) != relation_dom(function_inverse(X0))
| relation_dom(X0) != relation_rng(function_inverse(X0)) ) )
=> ( relation(sK0)
& one_to_one(sK0)
& function(sK0)
& ( relation_dom(function_inverse(sK0)) != relation_rng(sK0)
| relation_dom(sK0) != relation_rng(function_inverse(sK0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
? [X0] :
( relation(X0)
& one_to_one(X0)
& function(X0)
& ( relation_rng(X0) != relation_dom(function_inverse(X0))
| relation_dom(X0) != relation_rng(function_inverse(X0)) ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
? [X0] :
( ( relation_rng(X0) != relation_dom(function_inverse(X0))
| relation_dom(X0) != relation_rng(function_inverse(X0)) )
& one_to_one(X0)
& relation(X0)
& function(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0] :
( ( relation(X0)
& function(X0) )
=> ( one_to_one(X0)
=> ( relation_dom(X0) = relation_rng(function_inverse(X0))
& relation_rng(X0) = relation_dom(function_inverse(X0)) ) ) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0] :
( ( relation(X0)
& function(X0) )
=> ( one_to_one(X0)
=> ( relation_dom(X0) = relation_rng(function_inverse(X0))
& relation_rng(X0) = relation_dom(function_inverse(X0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_funct_1) ).
fof(f82,plain,
( ~ relation(sK0)
| spl3_2 ),
inference(trivial_inequality_removal,[],[f81]) ).
fof(f81,plain,
( ~ relation(sK0)
| relation_dom(sK0) != relation_dom(sK0)
| spl3_2 ),
inference(superposition,[],[f80,f44]) ).
fof(f44,plain,
! [X0] :
( relation_dom(X0) = relation_rng(relation_inverse(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0] :
( ~ relation(X0)
| ( relation_rng(X0) = relation_dom(relation_inverse(X0))
& relation_dom(X0) = relation_rng(relation_inverse(X0)) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] :
( relation(X0)
=> ( relation_rng(X0) = relation_dom(relation_inverse(X0))
& relation_dom(X0) = relation_rng(relation_inverse(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_relat_1) ).
fof(f80,plain,
( relation_rng(relation_inverse(sK0)) != relation_dom(sK0)
| spl3_2 ),
inference(subsumption_resolution,[],[f79,f35]) ).
fof(f35,plain,
one_to_one(sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f79,plain,
( ~ one_to_one(sK0)
| relation_rng(relation_inverse(sK0)) != relation_dom(sK0)
| spl3_2 ),
inference(subsumption_resolution,[],[f78,f34]) ).
fof(f34,plain,
function(sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f78,plain,
( ~ function(sK0)
| ~ one_to_one(sK0)
| relation_rng(relation_inverse(sK0)) != relation_dom(sK0)
| spl3_2 ),
inference(subsumption_resolution,[],[f77,f36]) ).
fof(f77,plain,
( ~ relation(sK0)
| ~ one_to_one(sK0)
| relation_rng(relation_inverse(sK0)) != relation_dom(sK0)
| ~ function(sK0)
| spl3_2 ),
inference(superposition,[],[f55,f40]) ).
fof(f40,plain,
! [X0] :
( function_inverse(X0) = relation_inverse(X0)
| ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0] :
( ~ function(X0)
| ~ relation(X0)
| ~ one_to_one(X0)
| function_inverse(X0) = relation_inverse(X0) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X0] :
( function_inverse(X0) = relation_inverse(X0)
| ~ one_to_one(X0)
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( ( relation(X0)
& function(X0) )
=> ( one_to_one(X0)
=> function_inverse(X0) = relation_inverse(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_funct_1) ).
fof(f55,plain,
( relation_dom(sK0) != relation_rng(function_inverse(sK0))
| spl3_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f53,plain,
( spl3_2
<=> relation_dom(sK0) = relation_rng(function_inverse(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f75,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f74]) ).
fof(f74,plain,
( $false
| spl3_1 ),
inference(subsumption_resolution,[],[f73,f36]) ).
fof(f73,plain,
( ~ relation(sK0)
| spl3_1 ),
inference(trivial_inequality_removal,[],[f72]) ).
fof(f72,plain,
( relation_rng(sK0) != relation_rng(sK0)
| ~ relation(sK0)
| spl3_1 ),
inference(superposition,[],[f71,f45]) ).
fof(f45,plain,
! [X0] :
( relation_rng(X0) = relation_dom(relation_inverse(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f71,plain,
( relation_dom(relation_inverse(sK0)) != relation_rng(sK0)
| spl3_1 ),
inference(subsumption_resolution,[],[f70,f36]) ).
fof(f70,plain,
( ~ relation(sK0)
| relation_dom(relation_inverse(sK0)) != relation_rng(sK0)
| spl3_1 ),
inference(subsumption_resolution,[],[f69,f35]) ).
fof(f69,plain,
( ~ one_to_one(sK0)
| ~ relation(sK0)
| relation_dom(relation_inverse(sK0)) != relation_rng(sK0)
| spl3_1 ),
inference(subsumption_resolution,[],[f64,f34]) ).
fof(f64,plain,
( relation_dom(relation_inverse(sK0)) != relation_rng(sK0)
| ~ function(sK0)
| ~ relation(sK0)
| ~ one_to_one(sK0)
| spl3_1 ),
inference(superposition,[],[f51,f40]) ).
fof(f51,plain,
( relation_dom(function_inverse(sK0)) != relation_rng(sK0)
| spl3_1 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f49,plain,
( spl3_1
<=> relation_dom(function_inverse(sK0)) = relation_rng(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f56,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f33,f53,f49]) ).
fof(f33,plain,
( relation_dom(sK0) != relation_rng(function_inverse(sK0))
| relation_dom(function_inverse(sK0)) != relation_rng(sK0) ),
inference(cnf_transformation,[],[f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU219+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/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 : n018.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 14:55:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (32166)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.50 % (32160)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.50 % (32166)First to succeed.
% 0.19/0.50 % (32185)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (32184)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.51 % (32174)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.51 % (32166)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (32166)------------------------------
% 0.19/0.51 % (32166)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (32166)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (32166)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (32166)Memory used [KB]: 5884
% 0.19/0.51 % (32166)Time elapsed: 0.095 s
% 0.19/0.51 % (32166)Instructions burned: 3 (million)
% 0.19/0.51 % (32166)------------------------------
% 0.19/0.51 % (32166)------------------------------
% 0.19/0.51 % (32159)Success in time 0.158 s
%------------------------------------------------------------------------------