TSTP Solution File: SET625+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET625+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n009.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:14:32 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 9 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 80 ( 28 ~; 21 |; 21 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 46 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,plain,
$false,
inference(subsumption_resolution,[],[f51,f20]) ).
fof(f20,plain,
~ intersect(sK0,sK2),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
( ~ intersect(sK0,sK2)
& subset(sK1,sK2)
& intersect(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f12]) ).
fof(f12,plain,
( ? [X0,X1,X2] :
( ~ intersect(X0,X2)
& subset(X1,X2)
& intersect(X0,X1) )
=> ( ~ intersect(sK0,sK2)
& subset(sK1,sK2)
& intersect(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
? [X0,X1,X2] :
( ~ intersect(X0,X2)
& subset(X1,X2)
& intersect(X0,X1) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
? [X0,X1,X2] :
( ~ intersect(X0,X2)
& subset(X1,X2)
& intersect(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X1,X2)
& intersect(X0,X1) )
=> intersect(X0,X2) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X0,X1,X2] :
( ( subset(X1,X2)
& intersect(X0,X1) )
=> intersect(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th101) ).
fof(f51,plain,
intersect(sK0,sK2),
inference(resolution,[],[f45,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| intersect(X1,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( intersect(X1,X0)
| ~ intersect(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( intersect(X0,X1)
=> intersect(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_intersect) ).
fof(f45,plain,
intersect(sK2,sK0),
inference(resolution,[],[f37,f36]) ).
fof(f36,plain,
member(sK3(sK0,sK1),sK2),
inference(resolution,[],[f33,f31]) ).
fof(f31,plain,
member(sK3(sK0,sK1),sK1),
inference(resolution,[],[f25,f18]) ).
fof(f18,plain,
intersect(sK0,sK1),
inference(cnf_transformation,[],[f13]) ).
fof(f25,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ( member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) )
| ~ intersect(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f15,f16]) ).
fof(f16,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
=> ( member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
| ~ intersect(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
| ~ intersect(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f33,plain,
! [X0] :
( ~ member(X0,sK1)
| member(X0,sK2) ),
inference(resolution,[],[f23,f19]) ).
fof(f19,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f37,plain,
! [X0] :
( ~ member(sK3(sK0,sK1),X0)
| intersect(X0,sK0) ),
inference(resolution,[],[f26,f29]) ).
fof(f29,plain,
member(sK3(sK0,sK1),sK0),
inference(resolution,[],[f24,f18]) ).
fof(f24,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| intersect(X0,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET625+3 : TPTP v8.1.2. Released v2.2.0.
% 0.13/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n009.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 16:39:38 EDT 2024
% 0.21/0.36 % CPUTime :
% 0.21/0.36 % (20855)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.38 % (20857)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.38 % (20856)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.21/0.38 % (20858)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.21/0.38 % (20859)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.21/0.38 % (20860)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.21/0.38 % (20861)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.21/0.38 % (20862)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.21/0.38 TRYING [1]
% 0.21/0.38 TRYING [1,1]
% 0.21/0.38 TRYING [2]
% 0.21/0.38 TRYING [1,1]
% 0.21/0.38 TRYING [2,1]
% 0.21/0.38 TRYING [1]
% 0.21/0.38 TRYING [2,1]
% 0.21/0.38 TRYING [2]
% 0.21/0.38 TRYING [3]
% 0.21/0.38 TRYING [3,1]
% 0.21/0.38 TRYING [3,1]
% 0.21/0.38 % (20860)First to succeed.
% 0.21/0.38 TRYING [3]
% 0.21/0.38 TRYING [2,2]
% 0.21/0.38 TRYING [2,2]
% 0.21/0.38 % (20858)Also succeeded, but the first one will report.
% 0.21/0.38 % (20861)Also succeeded, but the first one will report.
% 0.21/0.38 TRYING [3,2]
% 0.21/0.38 TRYING [4]
% 0.21/0.38 TRYING [3,2]
% 0.21/0.38 % (20860)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20855"
% 0.21/0.38 TRYING [4]
% 0.21/0.38 TRYING [3,3]
% 0.21/0.38 TRYING [3,3]
% 0.21/0.38 TRYING [5]
% 0.21/0.38 % (20860)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (20860)------------------------------
% 0.21/0.38 % (20860)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38 % (20860)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (20860)Memory used [KB]: 749
% 0.21/0.38 % (20860)Time elapsed: 0.004 s
% 0.21/0.38 % (20860)Instructions burned: 3 (million)
% 0.21/0.38 % (20855)Success in time 0.018 s
%------------------------------------------------------------------------------