TSTP Solution File: SET971+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET971+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue Apr 30 15:14:09 EDT 2024
% Result : Theorem 0.16s 0.38s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 14 unt; 0 def)
% Number of atoms : 41 ( 21 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 30 ( 12 ~; 2 |; 12 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 28 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f56,plain,
$false,
inference(trivial_inequality_removal,[],[f55]) ).
fof(f55,plain,
cartesian_product2(sK0,sK2) != cartesian_product2(sK0,sK2),
inference(forward_demodulation,[],[f54,f32]) ).
fof(f32,plain,
sK2 = set_intersection2(sK2,sK3),
inference(unit_resulting_resolution,[],[f22,f27]) ).
fof(f27,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f22,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
( cartesian_product2(sK0,sK2) != set_intersection2(cartesian_product2(sK0,sK3),cartesian_product2(sK1,sK2))
& subset(sK2,sK3)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f13,f15]) ).
fof(f15,plain,
( ? [X0,X1,X2,X3] :
( cartesian_product2(X0,X2) != set_intersection2(cartesian_product2(X0,X3),cartesian_product2(X1,X2))
& subset(X2,X3)
& subset(X0,X1) )
=> ( cartesian_product2(sK0,sK2) != set_intersection2(cartesian_product2(sK0,sK3),cartesian_product2(sK1,sK2))
& subset(sK2,sK3)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
? [X0,X1,X2,X3] :
( cartesian_product2(X0,X2) != set_intersection2(cartesian_product2(X0,X3),cartesian_product2(X1,X2))
& subset(X2,X3)
& subset(X0,X1) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
? [X0,X1,X2,X3] :
( cartesian_product2(X0,X2) != set_intersection2(cartesian_product2(X0,X3),cartesian_product2(X1,X2))
& subset(X2,X3)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> cartesian_product2(X0,X2) = set_intersection2(cartesian_product2(X0,X3),cartesian_product2(X1,X2)) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> cartesian_product2(X0,X2) = set_intersection2(cartesian_product2(X0,X3),cartesian_product2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t124_zfmisc_1) ).
fof(f54,plain,
cartesian_product2(sK0,sK2) != cartesian_product2(sK0,set_intersection2(sK2,sK3)),
inference(forward_demodulation,[],[f49,f26]) ).
fof(f26,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f49,plain,
cartesian_product2(sK0,sK2) != cartesian_product2(sK0,set_intersection2(sK3,sK2)),
inference(superposition,[],[f23,f40]) ).
fof(f40,plain,
! [X0,X1] : set_intersection2(cartesian_product2(sK0,X0),cartesian_product2(sK1,X1)) = cartesian_product2(sK0,set_intersection2(X0,X1)),
inference(superposition,[],[f28,f31]) ).
fof(f31,plain,
sK0 = set_intersection2(sK0,sK1),
inference(unit_resulting_resolution,[],[f21,f27]) ).
fof(f21,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
! [X2,X3,X0,X1] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2,X3] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t123_zfmisc_1) ).
fof(f23,plain,
cartesian_product2(sK0,sK2) != set_intersection2(cartesian_product2(sK0,sK3),cartesian_product2(sK1,sK2)),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET971+1 : TPTP v8.1.2. Released v3.2.0.
% 0.15/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.35 % Computer : n013.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 01:14:04 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 % (21787)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.38 % (21790)WARNING: value z3 for option sas not known
% 0.16/0.38 % (21789)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.38 % (21791)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.38 % (21788)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.38 % (21792)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.16/0.38 % (21790)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.16/0.38 % (21793)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.16/0.38 % (21794)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.16/0.38 TRYING [1]
% 0.16/0.38 TRYING [2]
% 0.16/0.38 % (21794)First to succeed.
% 0.16/0.38 TRYING [1]
% 0.16/0.38 TRYING [2]
% 0.16/0.38 % (21792)Also succeeded, but the first one will report.
% 0.16/0.38 TRYING [3]
% 0.16/0.38 % (21794)Refutation found. Thanks to Tanya!
% 0.16/0.38 % SZS status Theorem for theBenchmark
% 0.16/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.38 % (21794)------------------------------
% 0.16/0.38 % (21794)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.16/0.38 % (21794)Termination reason: Refutation
% 0.16/0.38
% 0.16/0.38 % (21794)Memory used [KB]: 749
% 0.16/0.38 % (21794)Time elapsed: 0.005 s
% 0.16/0.38 % (21794)Instructions burned: 4 (million)
% 0.16/0.38 % (21794)------------------------------
% 0.16/0.38 % (21794)------------------------------
% 0.16/0.38 % (21787)Success in time 0.01 s
%------------------------------------------------------------------------------