TSTP Solution File: SWC293+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC293+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_uns --cores 0 -t %d %s
% Computer : n010.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:40:11 EDT 2022
% Result : Theorem 1.86s 0.62s
% Output : Refutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 39 ( 9 unt; 0 def)
% Number of atoms : 195 ( 70 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 205 ( 49 ~; 45 |; 94 &)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 45 ( 15 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f666,plain,
$false,
inference(avatar_sat_refutation,[],[f600,f628,f654,f655,f661,f665]) ).
fof(f665,plain,
~ spl58_13,
inference(avatar_contradiction_clause,[],[f662]) ).
fof(f662,plain,
( $false
| ~ spl58_13 ),
inference(unit_resulting_resolution,[],[f644,f660]) ).
fof(f660,plain,
( strictorderedP(sK48)
| ~ spl58_13 ),
inference(avatar_component_clause,[],[f659]) ).
fof(f659,plain,
( spl58_13
<=> strictorderedP(sK48) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_13])]) ).
fof(f644,plain,
~ strictorderedP(sK48),
inference(backward_demodulation,[],[f516,f524]) ).
fof(f524,plain,
sK48 = sK46,
inference(cnf_transformation,[],[f330]) ).
fof(f330,plain,
( ssList(sK46)
& sK49 = sK47
& sK48 = sK46
& ( ( sK48 = cons(sK50,nil)
& ssItem(sK50)
& memberP(sK49,sK50) )
| ( nil = sK49
& nil = sK48 ) )
& ssList(sK49)
& ~ strictorderedP(sK46)
& ssList(sK48)
& ssList(sK47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK46,sK47,sK48,sK49,sK50])],[f149,f329,f328,f327,f326,f325]) ).
fof(f325,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ~ strictorderedP(X0) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK46)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& sK46 = X2
& ( ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ~ strictorderedP(sK46) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f326,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& sK46 = X2
& ( ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ~ strictorderedP(sK46) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK47 = X3
& sK46 = X2
& ( ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ~ strictorderedP(sK46) )
& ssList(X2) )
& ssList(sK47) ) ),
introduced(choice_axiom,[]) ).
fof(f327,plain,
( ? [X2] :
( ? [X3] :
( sK47 = X3
& sK46 = X2
& ( ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ~ strictorderedP(sK46) )
& ssList(X2) )
=> ( ? [X3] :
( sK47 = X3
& sK48 = sK46
& ( ? [X4] :
( cons(X4,nil) = sK48
& ssItem(X4)
& memberP(X3,X4) )
| ( nil = X3
& nil = sK48 ) )
& ssList(X3)
& ~ strictorderedP(sK46) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f328,plain,
( ? [X3] :
( sK47 = X3
& sK48 = sK46
& ( ? [X4] :
( cons(X4,nil) = sK48
& ssItem(X4)
& memberP(X3,X4) )
| ( nil = X3
& nil = sK48 ) )
& ssList(X3)
& ~ strictorderedP(sK46) )
=> ( sK49 = sK47
& sK48 = sK46
& ( ? [X4] :
( cons(X4,nil) = sK48
& ssItem(X4)
& memberP(sK49,X4) )
| ( nil = sK49
& nil = sK48 ) )
& ssList(sK49)
& ~ strictorderedP(sK46) ) ),
introduced(choice_axiom,[]) ).
fof(f329,plain,
( ? [X4] :
( cons(X4,nil) = sK48
& ssItem(X4)
& memberP(sK49,X4) )
=> ( sK48 = cons(sK50,nil)
& ssItem(sK50)
& memberP(sK49,sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ~ strictorderedP(X0) )
& ssList(X2) )
& ssList(X1) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X0 != X2
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ~ ssItem(X4) ) )
| strictorderedP(X0)
| ~ ssList(X3)
| X1 != X3 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X0 != X2
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ~ ssItem(X4) ) )
| strictorderedP(X0)
| ~ ssList(X3)
| X1 != X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f516,plain,
~ strictorderedP(sK46),
inference(cnf_transformation,[],[f330]) ).
fof(f661,plain,
( ~ spl58_1
| spl58_13
| ~ spl58_9
| ~ spl58_10 ),
inference(avatar_split_clause,[],[f656,f631,f626,f659,f595]) ).
fof(f595,plain,
( spl58_1
<=> ssItem(sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_1])]) ).
fof(f626,plain,
( spl58_9
<=> sK48 = cons(sK50,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_9])]) ).
fof(f631,plain,
( spl58_10
<=> ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_10])]) ).
fof(f656,plain,
( strictorderedP(sK48)
| ~ ssItem(sK50)
| ~ spl58_9
| ~ spl58_10 ),
inference(superposition,[],[f632,f627]) ).
fof(f627,plain,
( sK48 = cons(sK50,nil)
| ~ spl58_9 ),
inference(avatar_component_clause,[],[f626]) ).
fof(f632,plain,
( ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl58_10 ),
inference(avatar_component_clause,[],[f631]) ).
fof(f655,plain,
spl58_10,
inference(avatar_split_clause,[],[f511,f631]) ).
fof(f511,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f150,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).
fof(f654,plain,
~ spl58_2,
inference(avatar_contradiction_clause,[],[f651]) ).
fof(f651,plain,
( $false
| ~ spl58_2 ),
inference(unit_resulting_resolution,[],[f646,f424]) ).
fof(f424,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f646,plain,
( ~ strictorderedP(nil)
| ~ spl58_2 ),
inference(backward_demodulation,[],[f644,f599]) ).
fof(f599,plain,
( nil = sK48
| ~ spl58_2 ),
inference(avatar_component_clause,[],[f598]) ).
fof(f598,plain,
( spl58_2
<=> nil = sK48 ),
introduced(avatar_definition,[new_symbols(naming,[spl58_2])]) ).
fof(f628,plain,
( spl58_9
| spl58_2 ),
inference(avatar_split_clause,[],[f522,f598,f626]) ).
fof(f522,plain,
( nil = sK48
| sK48 = cons(sK50,nil) ),
inference(cnf_transformation,[],[f330]) ).
fof(f600,plain,
( spl58_1
| spl58_2 ),
inference(avatar_split_clause,[],[f520,f598,f595]) ).
fof(f520,plain,
( nil = sK48
| ssItem(sK50) ),
inference(cnf_transformation,[],[f330]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC293+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n010.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:37:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.59 % (7558)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.59 % (7555)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.59 % (7550)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.60 % (7547)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.60 % (7566)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.60 % (7563)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.60 % (7566)First to succeed.
% 0.20/0.61 % (7558)Refutation not found, incomplete strategy% (7558)------------------------------
% 0.20/0.61 % (7558)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.86/0.61 % (7539)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.86/0.61 % (7544)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 1.86/0.61 % (7558)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.86/0.61 % (7558)Termination reason: Refutation not found, incomplete strategy
% 1.86/0.61
% 1.86/0.61 % (7558)Memory used [KB]: 6140
% 1.86/0.61 % (7558)Time elapsed: 0.173 s
% 1.86/0.61 % (7558)Instructions burned: 6 (million)
% 1.86/0.61 % (7558)------------------------------
% 1.86/0.61 % (7558)------------------------------
% 1.86/0.61 % (7543)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.86/0.61 % (7550)Instruction limit reached!
% 1.86/0.61 % (7550)------------------------------
% 1.86/0.61 % (7550)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.86/0.61 % (7550)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.86/0.61 % (7550)Termination reason: Unknown
% 1.86/0.61 % (7550)Termination phase: Saturation
% 1.86/0.61
% 1.86/0.61 % (7550)Memory used [KB]: 6140
% 1.86/0.61 % (7550)Time elapsed: 0.007 s
% 1.86/0.61 % (7550)Instructions burned: 7 (million)
% 1.86/0.61 % (7550)------------------------------
% 1.86/0.61 % (7550)------------------------------
% 1.86/0.62 % (7545)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.86/0.62 % (7566)Refutation found. Thanks to Tanya!
% 1.86/0.62 % SZS status Theorem for theBenchmark
% 1.86/0.62 % SZS output start Proof for theBenchmark
% See solution above
% 1.86/0.62 % (7566)------------------------------
% 1.86/0.62 % (7566)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.86/0.62 % (7566)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.86/0.62 % (7566)Termination reason: Refutation
% 1.86/0.62
% 1.86/0.62 % (7566)Memory used [KB]: 6396
% 1.86/0.62 % (7566)Time elapsed: 0.174 s
% 1.86/0.62 % (7566)Instructions burned: 13 (million)
% 1.86/0.62 % (7566)------------------------------
% 1.86/0.62 % (7566)------------------------------
% 1.86/0.62 % (7538)Success in time 0.263 s
%------------------------------------------------------------------------------