TSTP Solution File: SEU307+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU307+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue May 21 03:58:46 EDT 2024
% Result : Theorem 0.22s 0.41s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 9 unt; 0 def)
% Number of atoms : 79 ( 29 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 73 ( 30 ~; 20 |; 12 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 43 ( 37 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f798,plain,
$false,
inference(trivial_inequality_removal,[],[f796]) ).
fof(f796,plain,
sK5 != sK5,
inference(superposition,[],[f297,f795]) ).
fof(f795,plain,
sK5 = subset_intersection2(the_carrier(sK4),sK5,the_carrier(sK4)),
inference(resolution,[],[f764,f149]) ).
fof(f149,plain,
one_sorted_str(sK4),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
( sK5 != subset_intersection2(the_carrier(sK4),sK5,cast_as_carrier_subset(sK4))
& element(sK5,powerset(the_carrier(sK4)))
& one_sorted_str(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f78,f130,f129]) ).
fof(f129,plain,
( ? [X0] :
( ? [X1] :
( subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) != X1
& element(X1,powerset(the_carrier(X0))) )
& one_sorted_str(X0) )
=> ( ? [X1] :
( subset_intersection2(the_carrier(sK4),X1,cast_as_carrier_subset(sK4)) != X1
& element(X1,powerset(the_carrier(sK4))) )
& one_sorted_str(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X1] :
( subset_intersection2(the_carrier(sK4),X1,cast_as_carrier_subset(sK4)) != X1
& element(X1,powerset(the_carrier(sK4))) )
=> ( sK5 != subset_intersection2(the_carrier(sK4),sK5,cast_as_carrier_subset(sK4))
& element(sK5,powerset(the_carrier(sK4))) ) ),
introduced(choice_axiom,[]) ).
fof(f78,plain,
? [X0] :
( ? [X1] :
( subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) != X1
& element(X1,powerset(the_carrier(X0))) )
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f59]) ).
fof(f59,negated_conjecture,
~ ! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) = X1 ) ),
inference(negated_conjecture,[],[f58]) ).
fof(f58,conjecture,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t15_pre_topc) ).
fof(f764,plain,
( ~ one_sorted_str(sK4)
| sK5 = subset_intersection2(the_carrier(sK4),sK5,the_carrier(sK4)) ),
inference(forward_demodulation,[],[f763,f519]) ).
fof(f519,plain,
sK5 = set_intersection2(sK5,the_carrier(sK4)),
inference(resolution,[],[f482,f150]) ).
fof(f150,plain,
element(sK5,powerset(the_carrier(sK4))),
inference(cnf_transformation,[],[f131]) ).
fof(f482,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| set_intersection2(X0,X1) = X0 ),
inference(resolution,[],[f229,f233]) ).
fof(f233,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f56]) ).
fof(f56,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f229,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f763,plain,
( subset_intersection2(the_carrier(sK4),sK5,the_carrier(sK4)) = set_intersection2(sK5,the_carrier(sK4))
| ~ one_sorted_str(sK4) ),
inference(forward_demodulation,[],[f757,f295]) ).
fof(f295,plain,
the_carrier(sK4) = cast_as_carrier_subset(sK4),
inference(resolution,[],[f162,f149]) ).
fof(f162,plain,
! [X0] :
( ~ one_sorted_str(X0)
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f80,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( one_sorted_str(X0)
=> cast_as_carrier_subset(X0) = the_carrier(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(f757,plain,
( subset_intersection2(the_carrier(sK4),sK5,cast_as_carrier_subset(sK4)) = set_intersection2(sK5,cast_as_carrier_subset(sK4))
| ~ one_sorted_str(sK4) ),
inference(resolution,[],[f665,f163]) ).
fof(f163,plain,
! [X0] :
( element(cast_as_carrier_subset(X0),powerset(the_carrier(X0)))
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f81,plain,
! [X0] :
( element(cast_as_carrier_subset(X0),powerset(the_carrier(X0)))
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0] :
( one_sorted_str(X0)
=> element(cast_as_carrier_subset(X0),powerset(the_carrier(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_pre_topc) ).
fof(f665,plain,
! [X0] :
( ~ element(X0,powerset(the_carrier(sK4)))
| subset_intersection2(the_carrier(sK4),sK5,X0) = set_intersection2(sK5,X0) ),
inference(resolution,[],[f240,f150]) ).
fof(f240,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0,X1,X2] :
( subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2)
| ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0)) ),
inference(flattening,[],[f116]) ).
fof(f116,plain,
! [X0,X1,X2] :
( subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2)
| ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f47]) ).
fof(f47,axiom,
! [X0,X1,X2] :
( ( element(X2,powerset(X0))
& element(X1,powerset(X0)) )
=> subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k5_subset_1) ).
fof(f297,plain,
sK5 != subset_intersection2(the_carrier(sK4),sK5,the_carrier(sK4)),
inference(backward_demodulation,[],[f151,f295]) ).
fof(f151,plain,
sK5 != subset_intersection2(the_carrier(sK4),sK5,cast_as_carrier_subset(sK4)),
inference(cnf_transformation,[],[f131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU307+1 : TPTP v8.2.0. Released v3.3.0.
% 0.08/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n006.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 : Sun May 19 16:25:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (27570)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (27573)WARNING: value z3 for option sas not known
% 0.15/0.38 % (27571)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (27574)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (27573)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 % (27572)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 % (27575)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 % (27576)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 % (27577)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.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.40 TRYING [1]
% 0.15/0.40 TRYING [4]
% 0.15/0.40 TRYING [2]
% 0.22/0.40 % (27576)First to succeed.
% 0.22/0.40 % (27576)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27570"
% 0.22/0.41 % (27576)Refutation found. Thanks to Tanya!
% 0.22/0.41 % SZS status Theorem for theBenchmark
% 0.22/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.41 % (27576)------------------------------
% 0.22/0.41 % (27576)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.41 % (27576)Termination reason: Refutation
% 0.22/0.41
% 0.22/0.41 % (27576)Memory used [KB]: 1021
% 0.22/0.41 % (27576)Time elapsed: 0.022 s
% 0.22/0.41 % (27576)Instructions burned: 34 (million)
% 0.22/0.41 % (27570)Success in time 0.04 s
%------------------------------------------------------------------------------