TSTP Solution File: LCL203-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL203-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_sat --cores 0 -t %d %s
% Computer : n022.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:47:18 EDT 2022
% Result : Unsatisfiable 0.18s 0.52s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 38 ( 27 unt; 0 def)
% Number of atoms : 53 ( 7 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 : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 33 ( 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f778,plain,
$false,
inference(subsumption_resolution,[],[f777,f261]) ).
fof(f261,plain,
~ theorem(or(sF2,sF4)),
inference(resolution,[],[f259,f46]) ).
fof(f46,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f7,f2]) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f7,axiom,
! [X3,X4] :
( ~ axiom(or(not(X4),X3))
| theorem(X3)
| ~ theorem(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f259,plain,
~ theorem(or(sF3,or(sF2,sF4))),
inference(subsumption_resolution,[],[f257,f17]) ).
fof(f17,plain,
~ theorem(sF6),
inference(definition_folding,[],[f9,f16,f15,f14,f13,f12,f11,f10]) ).
fof(f10,plain,
or(p,q) = sF0,
introduced(function_definition,[]) ).
fof(f11,plain,
not(sF0) = sF1,
introduced(function_definition,[]) ).
fof(f12,plain,
sF2 = not(sF1),
introduced(function_definition,[]) ).
fof(f13,plain,
not(p) = sF3,
introduced(function_definition,[]) ).
fof(f14,plain,
not(q) = sF4,
introduced(function_definition,[]) ).
fof(f15,plain,
sF5 = or(sF3,sF4),
introduced(function_definition,[]) ).
fof(f16,plain,
sF6 = or(sF2,sF5),
introduced(function_definition,[]) ).
fof(f9,axiom,
~ theorem(or(not(not(or(p,q))),or(not(p),not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f257,plain,
( theorem(sF6)
| ~ theorem(or(sF3,or(sF2,sF4))) ),
inference(resolution,[],[f248,f7]) ).
fof(f248,plain,
axiom(or(not(or(sF3,or(sF2,sF4))),sF6)),
inference(superposition,[],[f104,f16]) ).
fof(f104,plain,
! [X1] : axiom(or(not(or(sF3,or(X1,sF4))),or(X1,sF5))),
inference(superposition,[],[f4,f15]) ).
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(f777,plain,
theorem(or(sF2,sF4)),
inference(resolution,[],[f776,f48]) ).
fof(f48,plain,
! [X3,X4] :
( ~ theorem(or(X4,X3))
| theorem(or(X3,X4)) ),
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(f776,plain,
theorem(or(sF4,sF2)),
inference(forward_demodulation,[],[f762,f12]) ).
fof(f762,plain,
theorem(or(sF4,not(sF1))),
inference(resolution,[],[f715,f382]) ).
fof(f382,plain,
! [X2] : theorem(or(X2,not(X2))),
inference(resolution,[],[f374,f48]) ).
fof(f374,plain,
! [X2] : theorem(or(not(X2),X2)),
inference(resolution,[],[f300,f47]) ).
fof(f47,plain,
! [X2] :
( ~ theorem(or(X2,X2))
| theorem(X2) ),
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(f300,plain,
! [X6,X7] : theorem(or(X6,or(not(X7),X7))),
inference(resolution,[],[f98,f19]) ).
fof(f19,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f2,f6]) ).
fof(f6,axiom,
! [X3] :
( ~ axiom(X3)
| theorem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f98,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f4,f7]) ).
fof(f715,plain,
! [X1] :
( ~ theorem(or(sF1,X1))
| theorem(or(sF4,X1)) ),
inference(subsumption_resolution,[],[f696,f27]) ).
fof(f27,plain,
axiom(or(sF4,sF0)),
inference(forward_demodulation,[],[f24,f14]) ).
fof(f24,plain,
axiom(or(not(q),sF0)),
inference(superposition,[],[f2,f10]) ).
fof(f696,plain,
! [X1] :
( ~ axiom(or(sF4,sF0))
| ~ theorem(or(sF1,X1))
| theorem(or(sF4,X1)) ),
inference(superposition,[],[f141,f14]) ).
fof(f141,plain,
! [X4,X5] :
( ~ axiom(or(not(X5),sF0))
| ~ theorem(or(sF1,X4))
| theorem(or(not(X5),X4)) ),
inference(superposition,[],[f8,f11]) ).
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) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL203-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n022.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:44:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.47 % (18937)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.49 % (18945)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.18/0.51 % (18937)First to succeed.
% 0.18/0.52 % (18935)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.52 % (18925)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.52 % (18929)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.18/0.52 % (18925)Refutation not found, incomplete strategy% (18925)------------------------------
% 0.18/0.52 % (18925)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (18925)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (18925)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.52
% 0.18/0.52 % (18925)Memory used [KB]: 5373
% 0.18/0.52 % (18925)Time elapsed: 0.123 s
% 0.18/0.52 % (18925)------------------------------
% 0.18/0.52 % (18925)------------------------------
% 0.18/0.52 % (18937)Refutation found. Thanks to Tanya!
% 0.18/0.52 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.52 % (18937)------------------------------
% 0.18/0.52 % (18937)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (18937)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (18937)Termination reason: Refutation
% 0.18/0.52
% 0.18/0.52 % (18937)Memory used [KB]: 5884
% 0.18/0.52 % (18937)Time elapsed: 0.118 s
% 0.18/0.52 % (18937)Instructions burned: 27 (million)
% 0.18/0.52 % (18937)------------------------------
% 0.18/0.52 % (18937)------------------------------
% 0.18/0.52 % (18923)Success in time 0.179 s
%------------------------------------------------------------------------------