TSTP Solution File: NUM414+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NUM414+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 : n002.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:05:01 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 10 unt; 0 def)
% Number of atoms : 150 ( 16 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 182 ( 77 ~; 51 |; 38 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 51 ( 43 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f328,plain,
$false,
inference(subsumption_resolution,[],[f327,f166]) ).
fof(f166,plain,
ordinal(sK8),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
( ordinal(sK7)
& ~ proper_subset(sK8,sK7)
& sK7 != sK8
& ordinal(sK8)
& ~ proper_subset(sK7,sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f72,f116,f115]) ).
fof(f115,plain,
( ? [X0] :
( ordinal(X0)
& ? [X1] :
( ~ proper_subset(X1,X0)
& X0 != X1
& ordinal(X1)
& ~ proper_subset(X0,X1) ) )
=> ( ordinal(sK7)
& ? [X1] :
( ~ proper_subset(X1,sK7)
& sK7 != X1
& ordinal(X1)
& ~ proper_subset(sK7,X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
( ? [X1] :
( ~ proper_subset(X1,sK7)
& sK7 != X1
& ordinal(X1)
& ~ proper_subset(sK7,X1) )
=> ( ~ proper_subset(sK8,sK7)
& sK7 != sK8
& ordinal(sK8)
& ~ proper_subset(sK7,sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f72,plain,
? [X0] :
( ordinal(X0)
& ? [X1] :
( ~ proper_subset(X1,X0)
& X0 != X1
& ordinal(X1)
& ~ proper_subset(X0,X1) ) ),
inference(flattening,[],[f71]) ).
fof(f71,plain,
? [X0] :
( ? [X1] :
( X0 != X1
& ~ proper_subset(X1,X0)
& ~ proper_subset(X0,X1)
& ordinal(X1) )
& ordinal(X0) ),
inference(ennf_transformation,[],[f39]) ).
fof(f39,negated_conjecture,
~ ! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ~ ( X0 != X1
& ~ proper_subset(X1,X0)
& ~ proper_subset(X0,X1) ) ) ),
inference(negated_conjecture,[],[f38]) ).
fof(f38,conjecture,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ~ ( X0 != X1
& ~ proper_subset(X1,X0)
& ~ proper_subset(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_ordinal1) ).
fof(f327,plain,
~ ordinal(sK8),
inference(subsumption_resolution,[],[f326,f169]) ).
fof(f169,plain,
ordinal(sK7),
inference(cnf_transformation,[],[f117]) ).
fof(f326,plain,
( ~ ordinal(sK7)
| ~ ordinal(sK8) ),
inference(subsumption_resolution,[],[f325,f253]) ).
fof(f253,plain,
~ subset(sK7,sK8),
inference(subsumption_resolution,[],[f249,f165]) ).
fof(f165,plain,
~ proper_subset(sK7,sK8),
inference(cnf_transformation,[],[f117]) ).
fof(f249,plain,
( ~ subset(sK7,sK8)
| proper_subset(sK7,sK8) ),
inference(extensionality_resolution,[],[f148,f167]) ).
fof(f167,plain,
sK7 != sK8,
inference(cnf_transformation,[],[f117]) ).
fof(f148,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| proper_subset(X1,X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| proper_subset(X1,X0) ),
inference(rectify,[],[f92]) ).
fof(f92,plain,
! [X1,X0] :
( ~ subset(X0,X1)
| X0 = X1
| proper_subset(X0,X1) ),
inference(flattening,[],[f91]) ).
fof(f91,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,plain,
! [X0,X1] :
( ( subset(X0,X1)
& X0 != X1 )
=> proper_subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] :
( ( subset(X0,X1)
& X0 != X1 )
<=> proper_subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f325,plain,
( subset(sK7,sK8)
| ~ ordinal(sK8)
| ~ ordinal(sK7) ),
inference(resolution,[],[f316,f187]) ).
fof(f187,plain,
! [X0,X1] :
( ~ ordinal_subset(X0,X1)
| ~ ordinal(X0)
| subset(X0,X1)
| ~ ordinal(X1) ),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ( ( subset(X0,X1)
| ~ ordinal_subset(X0,X1) )
& ( ordinal_subset(X0,X1)
| ~ subset(X0,X1) ) )
| ~ ordinal(X0) ),
inference(rectify,[],[f123]) ).
fof(f123,plain,
! [X1,X0] :
( ~ ordinal(X0)
| ( ( subset(X1,X0)
| ~ ordinal_subset(X1,X0) )
& ( ordinal_subset(X1,X0)
| ~ subset(X1,X0) ) )
| ~ ordinal(X1) ),
inference(nnf_transformation,[],[f74]) ).
fof(f74,plain,
! [X1,X0] :
( ~ ordinal(X0)
| ( subset(X1,X0)
<=> ordinal_subset(X1,X0) )
| ~ ordinal(X1) ),
inference(flattening,[],[f73]) ).
fof(f73,plain,
! [X0,X1] :
( ( subset(X1,X0)
<=> ordinal_subset(X1,X0) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,plain,
! [X0,X1] :
( ( ordinal(X0)
& ordinal(X1) )
=> ( subset(X1,X0)
<=> ordinal_subset(X1,X0) ) ),
inference(rectify,[],[f31]) ).
fof(f31,axiom,
! [X1,X0] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f316,plain,
ordinal_subset(sK7,sK8),
inference(subsumption_resolution,[],[f315,f166]) ).
fof(f315,plain,
( ordinal_subset(sK7,sK8)
| ~ ordinal(sK8) ),
inference(subsumption_resolution,[],[f314,f169]) ).
fof(f314,plain,
( ~ ordinal(sK7)
| ~ ordinal(sK8)
| ordinal_subset(sK7,sK8) ),
inference(subsumption_resolution,[],[f293,f252]) ).
fof(f252,plain,
~ subset(sK8,sK7),
inference(subsumption_resolution,[],[f248,f168]) ).
fof(f168,plain,
~ proper_subset(sK8,sK7),
inference(cnf_transformation,[],[f117]) ).
fof(f248,plain,
( ~ subset(sK8,sK7)
| proper_subset(sK8,sK7) ),
inference(extensionality_resolution,[],[f148,f167]) ).
fof(f293,plain,
( subset(sK8,sK7)
| ~ ordinal(sK8)
| ~ ordinal(sK7)
| ordinal_subset(sK7,sK8) ),
inference(resolution,[],[f187,f267]) ).
fof(f267,plain,
( ordinal_subset(sK8,sK7)
| ordinal_subset(sK7,sK8) ),
inference(resolution,[],[f260,f166]) ).
fof(f260,plain,
! [X3] :
( ~ ordinal(X3)
| ordinal_subset(sK7,X3)
| ordinal_subset(X3,sK7) ),
inference(resolution,[],[f172,f169]) ).
fof(f172,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ordinal_subset(X1,X0)
| ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0,X1] :
( ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ordinal_subset(X1,X0)
| ~ ordinal(X0) ),
inference(rectify,[],[f79]) ).
fof(f79,plain,
! [X1,X0] :
( ordinal_subset(X1,X0)
| ~ ordinal(X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1) ),
inference(flattening,[],[f78]) ).
fof(f78,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0,X1] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1) ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( ordinal_subset(X0,X1)
| ordinal_subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM414+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/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.13/0.33 % Computer : n002.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 06:41:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (26769)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.50 % (26778)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.50 % (26770)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.50 % (26777)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 % (26767)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (26762)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (26778)First to succeed.
% 0.20/0.51 TRYING [1]
% 0.20/0.51 % (26785)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.51 TRYING [2]
% 0.20/0.51 TRYING [3]
% 0.20/0.52 TRYING [4]
% 0.20/0.52 % (26778)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (26778)------------------------------
% 0.20/0.52 % (26778)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (26778)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (26778)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (26778)Memory used [KB]: 1023
% 0.20/0.52 % (26778)Time elapsed: 0.073 s
% 0.20/0.52 % (26778)Instructions burned: 7 (million)
% 0.20/0.52 % (26778)------------------------------
% 0.20/0.52 % (26778)------------------------------
% 0.20/0.52 % (26755)Success in time 0.174 s
%------------------------------------------------------------------------------