TSTP Solution File: SET047+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET047+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n015.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:05:17 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 5
% Syntax : Number of formulae : 47 ( 5 unt; 0 def)
% Number of atoms : 147 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 149 ( 49 ~; 74 |; 16 &)
% ( 7 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 47 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f134,plain,
$false,
inference(subsumption_resolution,[],[f132,f68]) ).
fof(f68,plain,
set_equal(sK1,sK2),
inference(subsumption_resolution,[],[f62,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ sP0(X1,X0)
| set_equal(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ( set_equal(X0,X1)
| ~ sP0(X1,X0) )
& ( sP0(X1,X0)
| ~ set_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
! [X0,X1] :
( set_equal(X0,X1)
<=> sP0(X1,X0) ),
inference(definition_folding,[],[f1,f5]) ).
fof(f5,plain,
! [X1,X0] :
( sP0(X1,X0)
<=> ! [X2] :
( element(X2,X0)
<=> element(X2,X1) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f1,axiom,
! [X0,X1] :
( set_equal(X0,X1)
<=> ! [X2] :
( element(X2,X0)
<=> element(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel43_1) ).
fof(f62,plain,
( sP0(sK2,sK1)
| set_equal(sK1,sK2) ),
inference(resolution,[],[f61,f52]) ).
fof(f52,plain,
( element(sK3(sK2,sK1),sK1)
| set_equal(sK1,sK2) ),
inference(duplicate_literal_removal,[],[f51]) ).
fof(f51,plain,
( element(sK3(sK2,sK1),sK1)
| set_equal(sK1,sK2)
| set_equal(sK1,sK2) ),
inference(factoring,[],[f32]) ).
fof(f32,plain,
! [X0] :
( element(sK3(sK2,X0),X0)
| element(sK3(sK2,X0),sK1)
| set_equal(X0,sK2)
| set_equal(sK1,sK2) ),
inference(resolution,[],[f30,f26]) ).
fof(f26,plain,
! [X0] :
( ~ element(X0,sK2)
| element(X0,sK1)
| set_equal(sK1,sK2) ),
inference(resolution,[],[f17,f24]) ).
fof(f24,plain,
( sP0(sK1,sK2)
| set_equal(sK1,sK2) ),
inference(resolution,[],[f21,f15]) ).
fof(f15,plain,
( set_equal(sK2,sK1)
| set_equal(sK1,sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ( ~ set_equal(sK2,sK1)
| ~ set_equal(sK1,sK2) )
& ( set_equal(sK2,sK1)
| set_equal(sK1,sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f7,f8]) ).
fof(f8,plain,
( ? [X0,X1] :
( ( ~ set_equal(X1,X0)
| ~ set_equal(X0,X1) )
& ( set_equal(X1,X0)
| set_equal(X0,X1) ) )
=> ( ( ~ set_equal(sK2,sK1)
| ~ set_equal(sK1,sK2) )
& ( set_equal(sK2,sK1)
| set_equal(sK1,sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
? [X0,X1] :
( ( ~ set_equal(X1,X0)
| ~ set_equal(X0,X1) )
& ( set_equal(X1,X0)
| set_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X0,X1] :
( set_equal(X0,X1)
<~> set_equal(X1,X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,negated_conjecture,
~ ! [X0,X1] :
( set_equal(X0,X1)
<=> set_equal(X1,X0) ),
inference(negated_conjecture,[],[f2]) ).
fof(f2,conjecture,
! [X0,X1] :
( set_equal(X0,X1)
<=> set_equal(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel43) ).
fof(f21,plain,
! [X0,X1] :
( ~ set_equal(X0,X1)
| sP0(X1,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f17,plain,
! [X3,X0,X1] :
( ~ sP0(X0,X1)
| ~ element(X3,X1)
| element(X3,X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ( ( ~ element(sK3(X0,X1),X0)
| ~ element(sK3(X0,X1),X1) )
& ( element(sK3(X0,X1),X0)
| element(sK3(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( element(X3,X1)
| ~ element(X3,X0) )
& ( element(X3,X0)
| ~ element(X3,X1) ) )
| ~ sP0(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f11,f12]) ).
fof(f12,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ element(X2,X0)
| ~ element(X2,X1) )
& ( element(X2,X0)
| element(X2,X1) ) )
=> ( ( ~ element(sK3(X0,X1),X0)
| ~ element(sK3(X0,X1),X1) )
& ( element(sK3(X0,X1),X0)
| element(sK3(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ? [X2] :
( ( ~ element(X2,X0)
| ~ element(X2,X1) )
& ( element(X2,X0)
| element(X2,X1) ) ) )
& ( ! [X3] :
( ( element(X3,X1)
| ~ element(X3,X0) )
& ( element(X3,X0)
| ~ element(X3,X1) ) )
| ~ sP0(X0,X1) ) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
! [X1,X0] :
( ( sP0(X1,X0)
| ? [X2] :
( ( ~ element(X2,X1)
| ~ element(X2,X0) )
& ( element(X2,X1)
| element(X2,X0) ) ) )
& ( ! [X2] :
( ( element(X2,X0)
| ~ element(X2,X1) )
& ( element(X2,X1)
| ~ element(X2,X0) ) )
| ~ sP0(X1,X0) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f30,plain,
! [X0,X1] :
( element(sK3(X0,X1),X0)
| element(sK3(X0,X1),X1)
| set_equal(X1,X0) ),
inference(resolution,[],[f19,f22]) ).
fof(f19,plain,
! [X0,X1] :
( sP0(X0,X1)
| element(sK3(X0,X1),X0)
| element(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f61,plain,
( ~ element(sK3(sK2,sK1),sK1)
| sP0(sK2,sK1) ),
inference(subsumption_resolution,[],[f58,f21]) ).
fof(f58,plain,
( set_equal(sK1,sK2)
| sP0(sK2,sK1)
| ~ element(sK3(sK2,sK1),sK1) ),
inference(resolution,[],[f57,f20]) ).
fof(f20,plain,
! [X0,X1] :
( ~ element(sK3(X0,X1),X0)
| sP0(X0,X1)
| ~ element(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f57,plain,
( element(sK3(sK2,sK1),sK2)
| set_equal(sK1,sK2) ),
inference(duplicate_literal_removal,[],[f56]) ).
fof(f56,plain,
( set_equal(sK1,sK2)
| element(sK3(sK2,sK1),sK2)
| set_equal(sK1,sK2) ),
inference(resolution,[],[f52,f27]) ).
fof(f27,plain,
! [X0] :
( ~ element(X0,sK1)
| element(X0,sK2)
| set_equal(sK1,sK2) ),
inference(resolution,[],[f18,f24]) ).
fof(f18,plain,
! [X3,X0,X1] :
( ~ sP0(X0,X1)
| ~ element(X3,X0)
| element(X3,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f132,plain,
~ set_equal(sK1,sK2),
inference(resolution,[],[f131,f16]) ).
fof(f16,plain,
( ~ set_equal(sK2,sK1)
| ~ set_equal(sK1,sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f131,plain,
set_equal(sK2,sK1),
inference(subsumption_resolution,[],[f129,f22]) ).
fof(f129,plain,
( sP0(sK1,sK2)
| set_equal(sK2,sK1) ),
inference(resolution,[],[f125,f122]) ).
fof(f122,plain,
( element(sK3(sK1,sK2),sK2)
| set_equal(sK2,sK1) ),
inference(resolution,[],[f118,f78]) ).
fof(f78,plain,
! [X0] :
( ~ element(X0,sK1)
| element(X0,sK2) ),
inference(resolution,[],[f69,f17]) ).
fof(f69,plain,
sP0(sK2,sK1),
inference(resolution,[],[f68,f21]) ).
fof(f118,plain,
( element(sK3(sK1,sK2),sK1)
| set_equal(sK2,sK1) ),
inference(factoring,[],[f81]) ).
fof(f81,plain,
! [X0] :
( element(sK3(X0,sK2),sK1)
| element(sK3(X0,sK2),X0)
| set_equal(sK2,X0) ),
inference(resolution,[],[f77,f30]) ).
fof(f77,plain,
! [X0] :
( ~ element(X0,sK2)
| element(X0,sK1) ),
inference(resolution,[],[f69,f18]) ).
fof(f125,plain,
( ~ element(sK3(sK1,sK2),sK2)
| sP0(sK1,sK2) ),
inference(subsumption_resolution,[],[f121,f21]) ).
fof(f121,plain,
( set_equal(sK2,sK1)
| sP0(sK1,sK2)
| ~ element(sK3(sK1,sK2),sK2) ),
inference(resolution,[],[f118,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET047+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 01:48:47 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (10221)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (10222)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.37 % (10223)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.37 % (10224)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.15/0.37 % (10225)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.37 % (10226)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.37 % (10227)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.37 % (10228)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.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [1,1]
% 0.15/0.38 TRYING [1,1]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [2,1]
% 0.15/0.38 TRYING [2,1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [2,2]
% 0.15/0.38 TRYING [2,2]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 % (10226)First to succeed.
% 0.15/0.38 TRYING [3,3]
% 0.15/0.38 TRYING [3,3]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 TRYING [4]
% 0.15/0.38 TRYING [4,4]
% 0.15/0.38 TRYING [4,4]
% 0.15/0.38 TRYING [4]
% 0.15/0.38 % (10224)Also succeeded, but the first one will report.
% 0.15/0.38 TRYING [5]
% 0.15/0.38 TRYING [5,5]
% 0.15/0.38 TRYING [5,5]
% 0.15/0.38 TRYING [5]
% 0.15/0.38 TRYING [6]
% 0.15/0.38 % (10227)Also succeeded, but the first one will report.
% 0.15/0.38 % (10226)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38 % (10226)------------------------------
% 0.15/0.38 % (10226)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.38 % (10226)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (10226)Memory used [KB]: 757
% 0.15/0.38 % (10226)Time elapsed: 0.005 s
% 0.15/0.38 % (10226)Instructions burned: 6 (million)
% 0.15/0.38 % (10226)------------------------------
% 0.15/0.38 % (10226)------------------------------
% 0.15/0.38 % (10221)Success in time 0.02 s
%------------------------------------------------------------------------------