TSTP Solution File: SEU292+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU292+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n011.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 : Sun May 5 09:32:37 EDT 2024
% Result : Theorem 220.80s 31.88s
% Output : Refutation 220.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 19 unt; 0 def)
% Number of atoms : 200 ( 62 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 213 ( 68 ~; 56 |; 62 &)
% ( 9 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 112 ( 95 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3301807,plain,
$false,
inference(subsumption_resolution,[],[f3301801,f157]) ).
fof(f157,plain,
in(sK5,sK3),
inference(cnf_transformation,[],[f111]) ).
fof(f111,plain,
( apply(relation_composition(sK6,sK7),sK5) != apply(sK7,apply(sK6,sK5))
& empty_set != sK4
& in(sK5,sK3)
& function(sK7)
& relation(sK7)
& relation_of2_as_subset(sK6,sK3,sK4)
& quasi_total(sK6,sK3,sK4)
& function(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7])],[f67,f110,f109]) ).
fof(f109,plain,
( ? [X0,X1,X2,X3] :
( ? [X4] :
( apply(relation_composition(X3,X4),X2) != apply(X4,apply(X3,X2))
& empty_set != X1
& in(X2,X0)
& function(X4)
& relation(X4) )
& relation_of2_as_subset(X3,X0,X1)
& quasi_total(X3,X0,X1)
& function(X3) )
=> ( ? [X4] :
( apply(relation_composition(sK6,X4),sK5) != apply(X4,apply(sK6,sK5))
& empty_set != sK4
& in(sK5,sK3)
& function(X4)
& relation(X4) )
& relation_of2_as_subset(sK6,sK3,sK4)
& quasi_total(sK6,sK3,sK4)
& function(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
( ? [X4] :
( apply(relation_composition(sK6,X4),sK5) != apply(X4,apply(sK6,sK5))
& empty_set != sK4
& in(sK5,sK3)
& function(X4)
& relation(X4) )
=> ( apply(relation_composition(sK6,sK7),sK5) != apply(sK7,apply(sK6,sK5))
& empty_set != sK4
& in(sK5,sK3)
& function(sK7)
& relation(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f67,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( apply(relation_composition(X3,X4),X2) != apply(X4,apply(X3,X2))
& empty_set != X1
& in(X2,X0)
& function(X4)
& relation(X4) )
& relation_of2_as_subset(X3,X0,X1)
& quasi_total(X3,X0,X1)
& function(X3) ),
inference(flattening,[],[f66]) ).
fof(f66,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( apply(relation_composition(X3,X4),X2) != apply(X4,apply(X3,X2))
& empty_set != X1
& in(X2,X0)
& function(X4)
& relation(X4) )
& relation_of2_as_subset(X3,X0,X1)
& quasi_total(X3,X0,X1)
& function(X3) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( relation_of2_as_subset(X3,X0,X1)
& quasi_total(X3,X0,X1)
& function(X3) )
=> ! [X4] :
( ( function(X4)
& relation(X4) )
=> ( in(X2,X0)
=> ( apply(relation_composition(X3,X4),X2) = apply(X4,apply(X3,X2))
| empty_set = X1 ) ) ) ),
inference(negated_conjecture,[],[f48]) ).
fof(f48,conjecture,
! [X0,X1,X2,X3] :
( ( relation_of2_as_subset(X3,X0,X1)
& quasi_total(X3,X0,X1)
& function(X3) )
=> ! [X4] :
( ( function(X4)
& relation(X4) )
=> ( in(X2,X0)
=> ( apply(relation_composition(X3,X4),X2) = apply(X4,apply(X3,X2))
| empty_set = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_funct_2) ).
fof(f3301801,plain,
~ in(sK5,sK3),
inference(superposition,[],[f791745,f3301799]) ).
fof(f3301799,plain,
sK3 = relation_dom(sK6),
inference(superposition,[],[f442270,f586459]) ).
fof(f586459,plain,
sK3 = relation_dom_as_subset(sK3,sK4,sK6),
inference(unit_resulting_resolution,[],[f402,f109990,f153,f207]) ).
fof(f207,plain,
! [X2,X0,X1] :
( ~ sP1(X0,X1,X2)
| ~ quasi_total(X1,X0,X2)
| sP0(X0,X2)
| relation_dom_as_subset(X0,X2,X1) = X0 ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0,X1,X2] :
( ( ( quasi_total(X1,X0,X2)
| relation_dom_as_subset(X0,X2,X1) != X0 )
& ( relation_dom_as_subset(X0,X2,X1) = X0
| ~ quasi_total(X1,X0,X2) ) )
| sP0(X0,X2)
| ~ sP1(X0,X1,X2) ),
inference(rectify,[],[f128]) ).
fof(f128,plain,
! [X0,X2,X1] :
( ( ( quasi_total(X2,X0,X1)
| relation_dom_as_subset(X0,X1,X2) != X0 )
& ( relation_dom_as_subset(X0,X1,X2) = X0
| ~ quasi_total(X2,X0,X1) ) )
| sP0(X0,X1)
| ~ sP1(X0,X2,X1) ),
inference(nnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0,X2,X1] :
( ( quasi_total(X2,X0,X1)
<=> relation_dom_as_subset(X0,X1,X2) = X0 )
| sP0(X0,X1)
| ~ sP1(X0,X2,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f153,plain,
quasi_total(sK6,sK3,sK4),
inference(cnf_transformation,[],[f111]) ).
fof(f109990,plain,
sP1(sK3,sK6,sK4),
inference(unit_resulting_resolution,[],[f154,f211]) ).
fof(f211,plain,
! [X2,X0,X1] :
( ~ relation_of2_as_subset(X2,X0,X1)
| sP1(X0,X2,X1) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0,X1,X2] :
( ( sP2(X2,X1,X0)
& sP1(X0,X2,X1) )
| ~ relation_of2_as_subset(X2,X0,X1) ),
inference(definition_folding,[],[f98,f107,f106,f105]) ).
fof(f105,plain,
! [X0,X1] :
( ( empty_set != X0
& empty_set = X1 )
| ~ sP0(X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f107,plain,
! [X2,X1,X0] :
( ( quasi_total(X2,X0,X1)
<=> empty_set = X2 )
| empty_set = X0
| empty_set != X1
| ~ sP2(X2,X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ( ( ( quasi_total(X2,X0,X1)
<=> empty_set = X2 )
| empty_set = X0
| empty_set != X1 )
& ( ( quasi_total(X2,X0,X1)
<=> relation_dom_as_subset(X0,X1,X2) = X0 )
| ( empty_set != X0
& empty_set = X1 ) ) )
| ~ relation_of2_as_subset(X2,X0,X1) ),
inference(flattening,[],[f97]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ( ( ( quasi_total(X2,X0,X1)
<=> empty_set = X2 )
| empty_set = X0
| empty_set != X1 )
& ( ( quasi_total(X2,X0,X1)
<=> relation_dom_as_subset(X0,X1,X2) = X0 )
| ( empty_set != X0
& empty_set = X1 ) ) )
| ~ relation_of2_as_subset(X2,X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( relation_of2_as_subset(X2,X0,X1)
=> ( ( empty_set = X1
=> ( ( quasi_total(X2,X0,X1)
<=> empty_set = X2 )
| empty_set = X0 ) )
& ( ( empty_set = X1
=> empty_set = X0 )
=> ( quasi_total(X2,X0,X1)
<=> relation_dom_as_subset(X0,X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_funct_2) ).
fof(f154,plain,
relation_of2_as_subset(sK6,sK3,sK4),
inference(cnf_transformation,[],[f111]) ).
fof(f402,plain,
! [X0] : ~ sP0(X0,sK4),
inference(unit_resulting_resolution,[],[f158,f209]) ).
fof(f209,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| empty_set = X1 ),
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
! [X0,X1] :
( ( empty_set != X0
& empty_set = X1 )
| ~ sP0(X0,X1) ),
inference(nnf_transformation,[],[f105]) ).
fof(f158,plain,
empty_set != sK4,
inference(cnf_transformation,[],[f111]) ).
fof(f442270,plain,
relation_dom(sK6) = relation_dom_as_subset(sK3,sK4,sK6),
inference(unit_resulting_resolution,[],[f254085,f213]) ).
fof(f213,plain,
! [X2,X0,X1] :
( ~ relation_of2(X2,X0,X1)
| relation_dom_as_subset(X0,X1,X2) = relation_dom(X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f99,plain,
! [X0,X1,X2] :
( relation_dom_as_subset(X0,X1,X2) = relation_dom(X2)
| ~ relation_of2(X2,X0,X1) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,axiom,
! [X0,X1,X2] :
( relation_of2(X2,X0,X1)
=> relation_dom_as_subset(X0,X1,X2) = relation_dom(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k4_relset_1) ).
fof(f254085,plain,
relation_of2(sK6,sK3,sK4),
inference(unit_resulting_resolution,[],[f154,f217]) ).
fof(f217,plain,
! [X2,X0,X1] :
( ~ relation_of2_as_subset(X2,X0,X1)
| relation_of2(X2,X0,X1) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
! [X0,X1,X2] :
( ( relation_of2_as_subset(X2,X0,X1)
| ~ relation_of2(X2,X0,X1) )
& ( relation_of2(X2,X0,X1)
| ~ relation_of2_as_subset(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f45]) ).
fof(f45,axiom,
! [X0,X1,X2] :
( relation_of2_as_subset(X2,X0,X1)
<=> relation_of2(X2,X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(f791745,plain,
~ in(sK5,relation_dom(sK6)),
inference(unit_resulting_resolution,[],[f383139,f152,f155,f156,f159,f190]) ).
fof(f190,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_dom(X1))
| apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0))
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
! [X0,X1] :
( ! [X2] :
( apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0))
| ~ in(X0,relation_dom(X1))
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f89]) ).
fof(f89,plain,
! [X0,X1] :
( ! [X2] :
( apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0))
| ~ in(X0,relation_dom(X1))
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f50]) ).
fof(f50,axiom,
! [X0,X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X0,relation_dom(X1))
=> apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_funct_1) ).
fof(f159,plain,
apply(relation_composition(sK6,sK7),sK5) != apply(sK7,apply(sK6,sK5)),
inference(cnf_transformation,[],[f111]) ).
fof(f156,plain,
function(sK7),
inference(cnf_transformation,[],[f111]) ).
fof(f155,plain,
relation(sK7),
inference(cnf_transformation,[],[f111]) ).
fof(f152,plain,
function(sK6),
inference(cnf_transformation,[],[f111]) ).
fof(f383139,plain,
relation(sK6),
inference(unit_resulting_resolution,[],[f380018,f215]) ).
fof(f215,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(cartesian_product2(X0,X1)))
| relation(X2) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0,X1,X2] :
( relation(X2)
| ~ element(X2,powerset(cartesian_product2(X0,X1))) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( element(X2,powerset(cartesian_product2(X0,X1)))
=> relation(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_relset_1) ).
fof(f380018,plain,
element(sK6,powerset(cartesian_product2(sK3,sK4))),
inference(unit_resulting_resolution,[],[f154,f204]) ).
fof(f204,plain,
! [X2,X0,X1] :
( ~ relation_of2_as_subset(X2,X0,X1)
| element(X2,powerset(cartesian_product2(X0,X1))) ),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
! [X0,X1,X2] :
( element(X2,powerset(cartesian_product2(X0,X1)))
| ~ relation_of2_as_subset(X2,X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0,X1,X2] :
( relation_of2_as_subset(X2,X0,X1)
=> element(X2,powerset(cartesian_product2(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m2_relset_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU292+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 11:37:34 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (13111)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (13114)WARNING: value z3 for option sas not known
% 0.15/0.38 % (13113)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (13112)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (13115)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (13116)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38 % (13117)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38 % (13118)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38 % (13114)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.40 TRYING [4]
% 0.22/0.41 TRYING [3]
% 0.22/0.43 TRYING [5]
% 0.22/0.46 TRYING [4]
% 0.22/0.49 TRYING [6]
% 0.22/0.54 TRYING [5]
% 1.61/0.58 TRYING [7]
% 3.16/0.82 TRYING [8]
% 4.12/0.97 TRYING [6]
% 7.85/1.48 TRYING [1]
% 7.85/1.48 TRYING [2]
% 7.85/1.48 TRYING [3]
% 7.99/1.49 TRYING [4]
% 7.99/1.50 TRYING [5]
% 8.32/1.55 TRYING [6]
% 8.89/1.65 TRYING [7]
% 11.02/1.92 TRYING [8]
% 29.86/4.60 TRYING [9]
% 43.24/6.58 TRYING [9]
% 185.69/26.84 TRYING [7]
% 220.26/31.79 % (13118)First to succeed.
% 220.26/31.79 % (13118)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13111"
% 220.80/31.88 % (13118)Refutation found. Thanks to Tanya!
% 220.80/31.88 % SZS status Theorem for theBenchmark
% 220.80/31.88 % SZS output start Proof for theBenchmark
% See solution above
% 220.80/31.88 % (13118)------------------------------
% 220.80/31.88 % (13118)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 220.80/31.88 % (13118)Termination reason: Refutation
% 220.80/31.88
% 220.80/31.88 % (13118)Memory used [KB]: 638003
% 220.80/31.88 % (13118)Time elapsed: 31.389 s
% 220.80/31.88 % (13118)Instructions burned: 104738 (million)
% 220.80/31.88 % (13111)Success in time 31.071 s
%------------------------------------------------------------------------------