TSTP Solution File: SWC100+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC100+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n012.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 May 21 04:47:23 EDT 2024
% Result : Theorem 0.21s 0.43s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 11
% Syntax : Number of formulae : 68 ( 19 unt; 0 def)
% Number of atoms : 497 ( 200 equ)
% Maximal formula atoms : 46 ( 7 avg)
% Number of connectives : 678 ( 249 ~; 229 |; 172 &)
% ( 6 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 152 ( 104 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1705,plain,
$false,
inference(resolution,[],[f1704,f398]) ).
fof(f398,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f1704,plain,
~ ssList(nil),
inference(resolution,[],[f1583,f635]) ).
fof(f635,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f628]) ).
fof(f628,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f577]) ).
fof(f577,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f356]) ).
fof(f356,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f198]) ).
fof(f198,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/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f1583,plain,
neq(nil,nil),
inference(backward_demodulation,[],[f1556,f1558]) ).
fof(f1558,plain,
nil = sK19,
inference(backward_demodulation,[],[f379,f1554]) ).
fof(f1554,plain,
nil = sK21,
inference(trivial_inequality_removal,[],[f1523]) ).
fof(f1523,plain,
( nil != nil
| nil = sK21 ),
inference(backward_demodulation,[],[f642,f1518]) ).
fof(f1518,plain,
nil = sK18,
inference(resolution,[],[f1511,f648]) ).
fof(f648,plain,
ssList(sK18),
inference(forward_demodulation,[],[f377,f380]) ).
fof(f380,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f255]) ).
fof(f255,plain,
( ( ( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( nil != sK20
| nil = sK21 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK22
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& sK21 = app(sK20,sK22)
& ssList(sK22)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f99,f254,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(X1,sK18)
| ~ neq(sK18,nil) )
& neq(X1,nil) )
| ( nil != sK18
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(X1,sK18)
| ~ neq(sK18,nil) )
& neq(X1,nil) )
| ( nil != sK18
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( nil != sK20
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = X3
& ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( nil != sK20
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = X3
& ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( nil != sK20
| nil = sK21 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = sK21
& ssList(X4) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = sK21
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK22
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& sK21 = app(sK20,sK22)
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& 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] :
( ssList(X3)
=> ( ( ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f377,plain,
ssList(sK20),
inference(cnf_transformation,[],[f255]) ).
fof(f1511,plain,
( ~ ssList(sK18)
| nil = sK18 ),
inference(resolution,[],[f1509,f381]) ).
fof(f381,plain,
ssList(sK22),
inference(cnf_transformation,[],[f255]) ).
fof(f1509,plain,
( ~ ssList(sK22)
| nil = sK18
| ~ ssList(sK18) ),
inference(trivial_inequality_removal,[],[f1508]) ).
fof(f1508,plain,
( nil != nil
| nil = sK18
| ~ ssList(sK22)
| ~ ssList(sK18) ),
inference(duplicate_literal_removal,[],[f1499]) ).
fof(f1499,plain,
( nil != nil
| nil = sK18
| ~ ssList(sK22)
| ~ ssList(sK18)
| nil = sK18 ),
inference(superposition,[],[f1288,f1467]) ).
fof(f1467,plain,
( nil = sK19
| nil = sK18 ),
inference(resolution,[],[f1466,f398]) ).
fof(f1466,plain,
( ~ ssList(nil)
| nil = sK18
| nil = sK19 ),
inference(resolution,[],[f1465,f648]) ).
fof(f1465,plain,
( ~ ssList(sK18)
| ~ ssList(nil)
| nil = sK18
| nil = sK19 ),
inference(resolution,[],[f1464,f647]) ).
fof(f647,plain,
ssList(sK19),
inference(forward_demodulation,[],[f378,f379]) ).
fof(f378,plain,
ssList(sK21),
inference(cnf_transformation,[],[f255]) ).
fof(f1464,plain,
( ~ ssList(sK19)
| ~ ssList(sK18)
| ~ ssList(nil)
| nil = sK18
| nil = sK19 ),
inference(resolution,[],[f1463,f381]) ).
fof(f1463,plain,
( ~ ssList(sK22)
| ~ ssList(sK18)
| ~ ssList(sK19)
| ~ ssList(nil)
| nil = sK18
| nil = sK19 ),
inference(duplicate_literal_removal,[],[f1457]) ).
fof(f1457,plain,
( ~ ssList(sK22)
| ~ ssList(sK18)
| ~ ssList(sK19)
| ~ ssList(nil)
| ~ ssList(sK18)
| nil = sK18
| nil = sK19 ),
inference(resolution,[],[f1444,f966]) ).
fof(f966,plain,
( ~ frontsegP(sK19,sK18)
| ~ ssList(nil)
| ~ ssList(sK18)
| nil = sK18
| nil = sK19 ),
inference(resolution,[],[f578,f388]) ).
fof(f388,plain,
( ~ neq(sK18,nil)
| ~ frontsegP(sK19,sK18)
| nil = sK19 ),
inference(cnf_transformation,[],[f255]) ).
fof(f578,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f356]) ).
fof(f1444,plain,
( frontsegP(sK19,sK18)
| ~ ssList(sK22)
| ~ ssList(sK18)
| ~ ssList(sK19) ),
inference(superposition,[],[f631,f646]) ).
fof(f646,plain,
sK19 = app(sK18,sK22),
inference(forward_demodulation,[],[f645,f379]) ).
fof(f645,plain,
sK21 = app(sK18,sK22),
inference(forward_demodulation,[],[f382,f380]) ).
fof(f382,plain,
sK21 = app(sK20,sK22),
inference(cnf_transformation,[],[f255]) ).
fof(f631,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f588]) ).
fof(f588,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f369]) ).
fof(f369,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK67(X0,X1)) = X0
& ssList(sK67(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK67])],[f367,f368]) ).
fof(f368,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK67(X0,X1)) = X0
& ssList(sK67(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f367,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f366]) ).
fof(f366,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f201]) ).
fof(f201,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f1288,plain,
( nil != sK19
| nil = sK18
| ~ ssList(sK22)
| ~ ssList(sK18) ),
inference(superposition,[],[f590,f646]) ).
fof(f590,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f371]) ).
fof(f371,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f370]) ).
fof(f370,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f202]) ).
fof(f202,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(f642,plain,
( nil != sK18
| nil = sK21 ),
inference(forward_demodulation,[],[f385,f380]) ).
fof(f385,plain,
( nil != sK20
| nil = sK21 ),
inference(cnf_transformation,[],[f255]) ).
fof(f379,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f255]) ).
fof(f1556,plain,
neq(sK19,nil),
inference(trivial_inequality_removal,[],[f1520]) ).
fof(f1520,plain,
( nil != nil
| neq(sK19,nil) ),
inference(backward_demodulation,[],[f387,f1518]) ).
fof(f387,plain,
( nil != sK18
| neq(sK19,nil) ),
inference(cnf_transformation,[],[f255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC100+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n012.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 : Sun May 19 03:33:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (13066)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (13069)WARNING: value z3 for option sas not known
% 0.15/0.38 % (13070)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (13068)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (13067)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (13071)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.15/0.38 % (13069)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.15/0.38 % (13072)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.15/0.38 % (13073)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.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [2]
% 0.21/0.41 TRYING [3]
% 0.21/0.41 TRYING [3]
% 0.21/0.43 % (13072)First to succeed.
% 0.21/0.43 TRYING [1]
% 0.21/0.43 % (13072)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13066"
% 0.21/0.43 TRYING [2]
% 0.21/0.43 % (13072)Refutation found. Thanks to Tanya!
% 0.21/0.43 % SZS status Theorem for theBenchmark
% 0.21/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.43 % (13072)------------------------------
% 0.21/0.43 % (13072)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.43 % (13072)Termination reason: Refutation
% 0.21/0.43
% 0.21/0.43 % (13072)Memory used [KB]: 2028
% 0.21/0.43 % (13072)Time elapsed: 0.053 s
% 0.21/0.43 % (13072)Instructions burned: 92 (million)
% 0.21/0.43 % (13066)Success in time 0.062 s
%------------------------------------------------------------------------------