TSTP Solution File: SET903+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET903+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n025.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 : Wed Aug 31 18:26:03 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 85 ( 84 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 102 ( 46 ~; 19 |; 36 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 35 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f116,plain,
$false,
inference(subsumption_resolution,[],[f115,f28]) ).
fof(f28,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( set_union2(sK2,sK1) = singleton(sK0)
& empty_set != sK1
& empty_set != sK2
& sK1 != sK2 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1,X2] :
( singleton(X0) = set_union2(X2,X1)
& empty_set != X1
& empty_set != X2
& X1 != X2 )
=> ( set_union2(sK2,sK1) = singleton(sK0)
& empty_set != sK1
& empty_set != sK2
& sK1 != sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1,X2] :
( singleton(X0) = set_union2(X2,X1)
& empty_set != X1
& empty_set != X2
& X1 != X2 ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
? [X2,X1,X0] :
( set_union2(X0,X1) = singleton(X2)
& empty_set != X1
& empty_set != X0
& X0 != X1 ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X1,X2,X0] :
~ ( set_union2(X0,X1) = singleton(X2)
& empty_set != X1
& empty_set != X0
& X0 != X1 ),
inference(rectify,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X1,X2,X0] :
~ ( singleton(X0) = set_union2(X1,X2)
& X1 != X2
& empty_set != X1
& empty_set != X2 ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X1,X2,X0] :
~ ( singleton(X0) = set_union2(X1,X2)
& X1 != X2
& empty_set != X1
& empty_set != X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t44_zfmisc_1) ).
fof(f115,plain,
sK1 = sK2,
inference(trivial_inequality_removal,[],[f114]) ).
fof(f114,plain,
( sK1 = sK2
| sK2 != sK2 ),
inference(superposition,[],[f82,f80]) ).
fof(f80,plain,
singleton(sK0) = sK2,
inference(equality_resolution,[],[f79]) ).
fof(f79,plain,
! [X8] :
( singleton(X8) != singleton(sK0)
| singleton(X8) = sK2 ),
inference(subsumption_resolution,[],[f76,f29]) ).
fof(f29,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f20]) ).
fof(f76,plain,
! [X8] :
( singleton(X8) != singleton(sK0)
| empty_set = sK2
| singleton(X8) = sK2 ),
inference(superposition,[],[f46,f31]) ).
fof(f31,plain,
set_union2(sK2,sK1) = singleton(sK0),
inference(cnf_transformation,[],[f20]) ).
fof(f46,plain,
! [X2,X0,X1] :
( singleton(X0) != set_union2(X2,X1)
| singleton(X0) = X2
| empty_set = X2 ),
inference(duplicate_literal_removal,[],[f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( empty_set = X2
| singleton(X0) != set_union2(X2,X1)
| singleton(X0) = X2
| singleton(X0) = X2 ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( singleton(X0) = X1
& empty_set = X2 )
| ( singleton(X0) = X1
& singleton(X0) = X2 )
| singleton(X0) != set_union2(X2,X1)
| ( empty_set = X1
& singleton(X0) = X2 ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
! [X0,X2,X1] :
( ( singleton(X0) = X2
& empty_set = X1 )
| ( singleton(X0) = X2
& singleton(X0) = X1 )
| singleton(X0) != set_union2(X1,X2)
| ( empty_set = X2
& singleton(X0) = X1 ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X2,X1,X0] :
~ ( ~ ( empty_set = X2
& singleton(X0) = X1 )
& ~ ( singleton(X0) = X2
& empty_set = X1 )
& singleton(X0) = set_union2(X1,X2)
& ~ ( singleton(X0) = X2
& singleton(X0) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_zfmisc_1) ).
fof(f82,plain,
! [X9] :
( singleton(X9) != sK2
| sK1 = singleton(X9) ),
inference(backward_demodulation,[],[f78,f80]) ).
fof(f78,plain,
! [X9] :
( singleton(X9) != singleton(sK0)
| sK1 = singleton(X9) ),
inference(subsumption_resolution,[],[f77,f30]) ).
fof(f30,plain,
empty_set != sK1,
inference(cnf_transformation,[],[f20]) ).
fof(f77,plain,
! [X9] :
( sK1 = singleton(X9)
| empty_set = sK1
| singleton(X9) != singleton(sK0) ),
inference(superposition,[],[f46,f63]) ).
fof(f63,plain,
set_union2(sK1,sK2) = singleton(sK0),
inference(superposition,[],[f43,f31]) ).
fof(f43,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET903+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 14:38:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.50 % (19046)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.50 % (19046)First to succeed.
% 0.20/0.50 % (19054)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.50 % (19027)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.51 % (19046)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (19046)------------------------------
% 0.20/0.51 % (19046)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (19046)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (19046)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (19046)Memory used [KB]: 5373
% 0.20/0.51 % (19046)Time elapsed: 0.085 s
% 0.20/0.51 % (19046)Instructions burned: 4 (million)
% 0.20/0.51 % (19046)------------------------------
% 0.20/0.51 % (19046)------------------------------
% 0.20/0.51 % (19024)Success in time 0.159 s
%------------------------------------------------------------------------------