TSTP Solution File: LCL202-1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LCL202-1 : TPTP v8.1.0. Released v1.1.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 : 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 17:39:21 EDT 2022
% Result : Unsatisfiable 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 37 ( 26 unt; 0 def)
% Number of atoms : 52 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 19 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 30 ( 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f480,plain,
$false,
inference(subsumption_resolution,[],[f479,f432]) ).
fof(f432,plain,
theorem(or(sF2,sF3)),
inference(resolution,[],[f424,f36]) ).
fof(f36,plain,
! [X2,X1] :
( ~ theorem(or(X1,X2))
| theorem(or(X2,X1)) ),
inference(resolution,[],[f7,f3]) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f7,axiom,
! [X3,X4] :
( ~ axiom(or(not(X4),X3))
| ~ theorem(X4)
| theorem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f424,plain,
theorem(or(sF3,sF2)),
inference(resolution,[],[f359,f296]) ).
fof(f296,plain,
theorem(or(sF1,sF2)),
inference(resolution,[],[f257,f36]) ).
fof(f257,plain,
theorem(or(sF2,sF1)),
inference(resolution,[],[f234,f35]) ).
fof(f35,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f7,f1]) ).
fof(f1,axiom,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f234,plain,
! [X13] : theorem(or(X13,or(sF2,sF1))),
inference(resolution,[],[f65,f105]) ).
fof(f105,plain,
! [X0] : theorem(or(sF2,or(X0,sF1))),
inference(resolution,[],[f20,f6]) ).
fof(f6,axiom,
! [X3] :
( ~ axiom(X3)
| theorem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f20,plain,
! [X1] : axiom(or(sF2,or(X1,sF1))),
inference(superposition,[],[f2,f12]) ).
fof(f12,plain,
sF2 = not(sF1),
introduced(function_definition,[]) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(resolution,[],[f4,f7]) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f359,plain,
! [X2] :
( ~ theorem(or(sF1,X2))
| theorem(or(sF3,X2)) ),
inference(subsumption_resolution,[],[f350,f25]) ).
fof(f25,plain,
axiom(or(sF3,sF0)),
inference(forward_demodulation,[],[f22,f13]) ).
fof(f13,plain,
not(q) = sF3,
introduced(function_definition,[]) ).
fof(f22,plain,
axiom(or(not(q),sF0)),
inference(superposition,[],[f2,f10]) ).
fof(f10,plain,
or(p,q) = sF0,
introduced(function_definition,[]) ).
fof(f350,plain,
! [X2] :
( ~ axiom(or(sF3,sF0))
| theorem(or(sF3,X2))
| ~ theorem(or(sF1,X2)) ),
inference(superposition,[],[f86,f13]) ).
fof(f86,plain,
! [X0,X1] :
( ~ axiom(or(not(X1),sF0))
| ~ theorem(or(sF1,X0))
| theorem(or(not(X1),X0)) ),
inference(superposition,[],[f8,f11]) ).
fof(f11,plain,
not(sF0) = sF1,
introduced(function_definition,[]) ).
fof(f8,axiom,
! [X3,X4,X5] :
( ~ theorem(or(not(X4),X5))
| theorem(or(not(X3),X5))
| ~ axiom(or(not(X3),X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_3) ).
fof(f479,plain,
~ theorem(or(sF2,sF3)),
inference(resolution,[],[f477,f37]) ).
fof(f37,plain,
! [X3,X4] :
( theorem(or(X4,X3))
| ~ theorem(X3) ),
inference(resolution,[],[f7,f2]) ).
fof(f477,plain,
~ theorem(or(p,or(sF2,sF3))),
inference(subsumption_resolution,[],[f475,f16]) ).
fof(f16,plain,
~ theorem(sF5),
inference(definition_folding,[],[f9,f15,f14,f13,f12,f11,f10]) ).
fof(f14,plain,
sF4 = or(p,sF3),
introduced(function_definition,[]) ).
fof(f15,plain,
sF5 = or(sF2,sF4),
introduced(function_definition,[]) ).
fof(f9,axiom,
~ theorem(or(not(not(or(p,q))),or(p,not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f475,plain,
( theorem(sF5)
| ~ theorem(or(p,or(sF2,sF3))) ),
inference(resolution,[],[f193,f7]) ).
fof(f193,plain,
axiom(or(not(or(p,or(sF2,sF3))),sF5)),
inference(superposition,[],[f71,f15]) ).
fof(f71,plain,
! [X1] : axiom(or(not(or(p,or(X1,sF3))),or(X1,sF4))),
inference(superposition,[],[f4,f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL202-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n002.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 01:55:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.48 % (13680)lrs+10_1:1_kws=precedence:lwlo=on:tgt=ground:i=99966:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99966Mi)
% 0.18/0.49 % (13680)First to succeed.
% 0.18/0.50 % (13700)lrs+10_1:7_av=off:awrs=converge:awrsf=40:br=off:bsd=on:cond=on:drc=off:nwc=3.0:plsq=on:plsqc=1:s2a=on:s2agt=16:to=lpo:urr=on:i=6:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.18/0.50 % (13691)dis+4_1:1_bd=off:cond=fast:fde=unused:lcm=reverse:lma=on:nicw=on:nwc=2.0:s2a=on:s2agt=16:sac=on:sp=frequency:i=23:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/23Mi)
% 0.18/0.50 % (13700)Instruction limit reached!
% 0.18/0.50 % (13700)------------------------------
% 0.18/0.50 % (13700)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (13700)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (13700)Termination reason: Unknown
% 0.18/0.50 % (13700)Termination phase: Saturation
% 0.18/0.50
% 0.18/0.50 % (13700)Memory used [KB]: 1407
% 0.18/0.50 % (13700)Time elapsed: 0.104 s
% 0.18/0.50 % (13700)Instructions burned: 7 (million)
% 0.18/0.50 % (13700)------------------------------
% 0.18/0.50 % (13700)------------------------------
% 0.18/0.50 % (13680)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50 % (13680)------------------------------
% 0.18/0.50 % (13680)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (13680)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (13680)Termination reason: Refutation
% 0.18/0.50
% 0.18/0.50 % (13680)Memory used [KB]: 6268
% 0.18/0.50 % (13680)Time elapsed: 0.104 s
% 0.18/0.50 % (13680)Instructions burned: 20 (million)
% 0.18/0.50 % (13680)------------------------------
% 0.18/0.50 % (13680)------------------------------
% 0.18/0.50 % (13679)Success in time 0.16 s
%------------------------------------------------------------------------------