TSTP Solution File: SWC102+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC102+1 : TPTP v8.1.0. Released v2.4.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 : n005.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:41:45 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 140 ( 44 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 155 ( 40 ~; 24 |; 78 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 35 ( 11 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f605,plain,
$false,
inference(subsumption_resolution,[],[f604,f601]) ).
fof(f601,plain,
neq(sK41,nil),
inference(forward_demodulation,[],[f505,f595]) ).
fof(f595,plain,
sK41 = sK42,
inference(forward_demodulation,[],[f594,f502]) ).
fof(f502,plain,
sK41 = sK43,
inference(cnf_transformation,[],[f314]) ).
fof(f314,plain,
( ssList(sK41)
& ( ~ neq(sK41,nil)
| ~ frontsegP(sK42,sK41) )
& sK43 = sK44
& neq(sK42,nil)
& ssList(sK44)
& sK44 = sK42
& sK41 = sK43
& ssList(sK43)
& ssList(sK42) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK41,sK42,sK43,sK44])],[f220,f313,f312,f311,f310]) ).
fof(f310,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& X2 = X3
& neq(X1,nil)
& ssList(X3)
& X1 = X3
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK41)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(sK41,nil)
| ~ frontsegP(X1,sK41) )
& X2 = X3
& neq(X1,nil)
& ssList(X3)
& X1 = X3
& sK41 = X2 )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f311,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(sK41,nil)
| ~ frontsegP(X1,sK41) )
& X2 = X3
& neq(X1,nil)
& ssList(X3)
& X1 = X3
& sK41 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(sK41,nil)
| ~ frontsegP(sK42,sK41) )
& X2 = X3
& neq(sK42,nil)
& ssList(X3)
& sK42 = X3
& sK41 = X2 )
& ssList(X2) )
& ssList(sK42) ) ),
introduced(choice_axiom,[]) ).
fof(f312,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(sK41,nil)
| ~ frontsegP(sK42,sK41) )
& X2 = X3
& neq(sK42,nil)
& ssList(X3)
& sK42 = X3
& sK41 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(sK41,nil)
| ~ frontsegP(sK42,sK41) )
& sK43 = X3
& neq(sK42,nil)
& ssList(X3)
& sK42 = X3
& sK41 = sK43 )
& ssList(sK43) ) ),
introduced(choice_axiom,[]) ).
fof(f313,plain,
( ? [X3] :
( ( ~ neq(sK41,nil)
| ~ frontsegP(sK42,sK41) )
& sK43 = X3
& neq(sK42,nil)
& ssList(X3)
& sK42 = X3
& sK41 = sK43 )
=> ( ( ~ neq(sK41,nil)
| ~ frontsegP(sK42,sK41) )
& sK43 = sK44
& neq(sK42,nil)
& ssList(sK44)
& sK44 = sK42
& sK41 = sK43 ) ),
introduced(choice_axiom,[]) ).
fof(f220,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& X2 = X3
& neq(X1,nil)
& ssList(X3)
& X1 = X3
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f219]) ).
fof(f219,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& neq(X1,nil)
& X2 = 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)
=> ( X0 != X2
| X1 != X3
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil)
| X2 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| X1 != X3
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil)
| X2 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f594,plain,
sK43 = sK42,
inference(forward_demodulation,[],[f506,f503]) ).
fof(f503,plain,
sK44 = sK42,
inference(cnf_transformation,[],[f314]) ).
fof(f506,plain,
sK43 = sK44,
inference(cnf_transformation,[],[f314]) ).
fof(f505,plain,
neq(sK42,nil),
inference(cnf_transformation,[],[f314]) ).
fof(f604,plain,
~ neq(sK41,nil),
inference(subsumption_resolution,[],[f603,f508]) ).
fof(f508,plain,
ssList(sK41),
inference(cnf_transformation,[],[f314]) ).
fof(f603,plain,
( ~ ssList(sK41)
| ~ neq(sK41,nil) ),
inference(resolution,[],[f526,f598]) ).
fof(f598,plain,
( ~ frontsegP(sK41,sK41)
| ~ neq(sK41,nil) ),
inference(backward_demodulation,[],[f507,f595]) ).
fof(f507,plain,
( ~ frontsegP(sK42,sK41)
| ~ neq(sK41,nil) ),
inference(cnf_transformation,[],[f314]) ).
fof(f526,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f209]) ).
fof(f209,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC102+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:18:33 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.47 % (19241)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.48 % (19241)First to succeed.
% 0.19/0.48 % (19249)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.49 % (19241)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (19241)------------------------------
% 0.19/0.49 % (19241)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (19241)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (19241)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (19241)Memory used [KB]: 1407
% 0.19/0.49 % (19241)Time elapsed: 0.070 s
% 0.19/0.49 % (19241)Instructions burned: 15 (million)
% 0.19/0.49 % (19241)------------------------------
% 0.19/0.49 % (19241)------------------------------
% 0.19/0.49 % (19225)Success in time 0.141 s
%------------------------------------------------------------------------------