TSTP Solution File: SWC275+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC275+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n019.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 16:15:26 EDT 2024
% Result : Theorem 0.22s 0.42s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 221 ( 88 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 256 ( 76 ~; 67 |; 97 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 51 ( 21 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1071,plain,
$false,
inference(resolution,[],[f1033,f392]) ).
fof(f392,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f1033,plain,
~ totalorderedP(nil),
inference(backward_demodulation,[],[f636,f1030]) ).
fof(f1030,plain,
nil = sK20,
inference(trivial_inequality_removal,[],[f1019]) ).
fof(f1019,plain,
( nil != nil
| nil = sK20 ),
inference(backward_demodulation,[],[f381,f1016]) ).
fof(f1016,plain,
nil = sK21,
inference(resolution,[],[f1015,f393]) ).
fof(f393,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f1015,plain,
( ~ ssList(nil)
| nil = sK21 ),
inference(resolution,[],[f1007,f377]) ).
fof(f377,plain,
ssList(sK21),
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
( ( ~ neq(sK21,nil)
| ( memberP(sK21,sK22)
& sK20 = cons(sK22,nil)
& ssItem(sK22) ) )
& ( nil != sK21
| nil = sK20 )
& ~ totalorderedP(sK18)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f98,f253,f252,f251,f250,f249]) ).
fof(f249,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK18)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f250,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK18)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK18)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK18)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK20
& ssItem(X4) ) )
& ( nil != X3
| nil = sK20 )
& ~ totalorderedP(sK18)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK20
& ssItem(X4) ) )
& ( nil != X3
| nil = sK20 )
& ~ totalorderedP(sK18)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ~ neq(sK21,nil)
| ? [X4] :
( memberP(sK21,X4)
& cons(X4,nil) = sK20
& ssItem(X4) ) )
& ( nil != sK21
| nil = sK20 )
& ~ totalorderedP(sK18)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X4] :
( memberP(sK21,X4)
& cons(X4,nil) = sK20
& ssItem(X4) )
=> ( memberP(sK21,sK22)
& sK20 = cons(sK22,nil)
& ssItem(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| ( nil = X3
& nil != X2 )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| ( nil = X3
& nil != X2 )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f1007,plain,
( ~ ssList(sK21)
| ~ ssList(nil)
| nil = sK21 ),
inference(duplicate_literal_removal,[],[f1004]) ).
fof(f1004,plain,
( nil = sK21
| ~ ssList(nil)
| ~ ssList(sK21)
| nil = sK21 ),
inference(resolution,[],[f1003,f969]) ).
fof(f969,plain,
( ssItem(sK22)
| ~ ssList(nil)
| ~ ssList(sK21)
| nil = sK21 ),
inference(resolution,[],[f573,f382]) ).
fof(f382,plain,
( ~ neq(sK21,nil)
| ssItem(sK22) ),
inference(cnf_transformation,[],[f254]) ).
fof(f573,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f355]) ).
fof(f355,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f197]) ).
fof(f197,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f1003,plain,
( ~ ssItem(sK22)
| nil = sK21 ),
inference(resolution,[],[f993,f636]) ).
fof(f993,plain,
( totalorderedP(sK20)
| ~ ssItem(sK22)
| nil = sK21 ),
inference(superposition,[],[f404,f986]) ).
fof(f986,plain,
( sK20 = cons(sK22,nil)
| nil = sK21 ),
inference(resolution,[],[f985,f393]) ).
fof(f985,plain,
( ~ ssList(nil)
| nil = sK21
| sK20 = cons(sK22,nil) ),
inference(resolution,[],[f968,f377]) ).
fof(f968,plain,
( ~ ssList(sK21)
| ~ ssList(nil)
| nil = sK21
| sK20 = cons(sK22,nil) ),
inference(resolution,[],[f573,f383]) ).
fof(f383,plain,
( ~ neq(sK21,nil)
| sK20 = cons(sK22,nil) ),
inference(cnf_transformation,[],[f254]) ).
fof(f404,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(f381,plain,
( nil != sK21
| nil = sK20 ),
inference(cnf_transformation,[],[f254]) ).
fof(f636,plain,
~ totalorderedP(sK20),
inference(forward_demodulation,[],[f380,f379]) ).
fof(f379,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f380,plain,
~ totalorderedP(sK18),
inference(cnf_transformation,[],[f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC275+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.36 % Computer : n019.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % 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 04:09:14 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.37 % (9995)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.38 % (9998)WARNING: value z3 for option sas not known
% 0.16/0.39 % (9997)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.39 % (9999)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.39 % (9996)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.39 % (9998)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.39 % (10000)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.39 % (10002)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.39 % (10001)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.22/0.40 TRYING [1]
% 0.22/0.40 TRYING [1]
% 0.22/0.40 TRYING [2]
% 0.22/0.40 TRYING [2]
% 0.22/0.41 TRYING [3]
% 0.22/0.41 % (10001)First to succeed.
% 0.22/0.41 TRYING [3]
% 0.22/0.41 % (9998)Also succeeded, but the first one will report.
% 0.22/0.42 % (10001)Refutation found. Thanks to Tanya!
% 0.22/0.42 % SZS status Theorem for theBenchmark
% 0.22/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.42 % (10001)------------------------------
% 0.22/0.42 % (10001)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.42 % (10001)Termination reason: Refutation
% 0.22/0.42
% 0.22/0.42 % (10001)Memory used [KB]: 1592
% 0.22/0.42 % (10001)Time elapsed: 0.029 s
% 0.22/0.42 % (10001)Instructions burned: 48 (million)
% 0.22/0.42 % (10001)------------------------------
% 0.22/0.42 % (10001)------------------------------
% 0.22/0.42 % (9995)Success in time 0.048 s
%------------------------------------------------------------------------------