TSTP Solution File: SEU306+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU306+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 : n019.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:28:34 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 27 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 23 ( 11 ~; 3 |; 4 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 10 ( 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f171,plain,
$false,
inference(subsumption_resolution,[],[f169,f160]) ).
fof(f160,plain,
one_sorted_str(sK5),
inference(cnf_transformation,[],[f103]) ).
fof(f103,plain,
( one_sorted_str(sK5)
& cast_as_carrier_subset(sK5) != the_carrier(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f67,f102]) ).
fof(f102,plain,
( ? [X0] :
( one_sorted_str(X0)
& cast_as_carrier_subset(X0) != the_carrier(X0) )
=> ( one_sorted_str(sK5)
& cast_as_carrier_subset(sK5) != the_carrier(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f67,plain,
? [X0] :
( one_sorted_str(X0)
& cast_as_carrier_subset(X0) != the_carrier(X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f41,negated_conjecture,
~ ! [X0] :
( one_sorted_str(X0)
=> cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(negated_conjecture,[],[f40]) ).
fof(f40,conjecture,
! [X0] :
( one_sorted_str(X0)
=> cast_as_carrier_subset(X0) = the_carrier(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_pre_topc) ).
fof(f169,plain,
~ one_sorted_str(sK5),
inference(resolution,[],[f165,f162]) ).
fof(f162,plain,
! [X0] :
( sQ6_eqProxy(cast_as_carrier_subset(X0),the_carrier(X0))
| ~ one_sorted_str(X0) ),
inference(equality_proxy_replacement,[],[f105,f161]) ).
fof(f161,plain,
! [X0,X1] :
( sQ6_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ6_eqProxy])]) ).
fof(f105,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f39]) ).
fof(f39,axiom,
! [X0] :
( one_sorted_str(X0)
=> cast_as_carrier_subset(X0) = the_carrier(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(f165,plain,
~ sQ6_eqProxy(cast_as_carrier_subset(sK5),the_carrier(sK5)),
inference(equality_proxy_replacement,[],[f159,f161]) ).
fof(f159,plain,
cast_as_carrier_subset(sK5) != the_carrier(sK5),
inference(cnf_transformation,[],[f103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU306+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/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 : n019.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 15:12:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % (9043)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.47 % (9049)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.19/0.47 % (9049)First to succeed.
% 0.19/0.48 % (9049)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (9049)------------------------------
% 0.19/0.48 % (9049)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (9049)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (9049)Termination reason: Refutation
% 0.19/0.48
% 0.19/0.48 % (9049)Memory used [KB]: 6012
% 0.19/0.48 % (9049)Time elapsed: 0.091 s
% 0.19/0.48 % (9049)Instructions burned: 3 (million)
% 0.19/0.48 % (9049)------------------------------
% 0.19/0.48 % (9049)------------------------------
% 0.19/0.48 % (9033)Success in time 0.136 s
%------------------------------------------------------------------------------