TSTP Solution File: LCL235-3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL235-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n011.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 : Sun May 5 07:44:52 EDT 2024
% Result : Unsatisfiable 0.21s 0.60s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 19 unt; 0 def)
% Number of atoms : 74 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 63 ( 33 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 90 ( 90 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5433,plain,
$false,
inference(subsumption_resolution,[],[f5404,f1077]) ).
fof(f1077,plain,
! [X0,X1] : theorem(or(implies(X0,not(X1)),and(X0,X1))),
inference(resolution,[],[f1073,f17]) ).
fof(f17,plain,
! [X0,X1] :
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(resolution,[],[f15,f3]) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f15,plain,
! [X0,X1] :
( ~ axiom(implies(X1,X0))
| ~ theorem(X1)
| theorem(X0) ),
inference(resolution,[],[f8,f7]) ).
fof(f7,axiom,
! [X3] :
( theorem(X3)
| ~ axiom(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X3,X4] :
( ~ theorem(implies(X4,X3))
| theorem(X3)
| ~ theorem(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f1073,plain,
! [X0,X1] : theorem(or(and(X0,X1),implies(X0,not(X1)))),
inference(resolution,[],[f1062,f171]) ).
fof(f171,plain,
! [X2,X0,X1] : axiom(or(and(X0,X1),or(X2,implies(X0,not(X1))))),
inference(superposition,[],[f2,f60]) ).
fof(f60,plain,
! [X2,X0,X1] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[],[f6,f43]) ).
fof(f43,plain,
! [X6,X5] : and(X5,X6) = not(implies(X5,not(X6))),
inference(forward_demodulation,[],[f9,f6]) ).
fof(f9,axiom,
! [X6,X5] : and(X5,X6) = not(or(not(X5),not(X6))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
fof(f6,axiom,
! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f1062,plain,
! [X0,X1] :
( ~ axiom(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f251,f658]) ).
fof(f658,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X0)))
| theorem(or(X1,X0)) ),
inference(resolution,[],[f624,f16]) ).
fof(f16,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f15,f1]) ).
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f624,plain,
! [X2,X0,X1] :
( theorem(or(X1,or(X2,X0)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f505,f95]) ).
fof(f95,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(resolution,[],[f4,f15]) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f505,plain,
! [X2,X0,X1] :
( theorem(or(X2,or(X1,X0)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f438,f3]) ).
fof(f438,plain,
! [X2,X0,X1] :
( ~ axiom(implies(X2,X1))
| ~ theorem(X2)
| theorem(or(X0,X1)) ),
inference(resolution,[],[f365,f7]) ).
fof(f365,plain,
! [X2,X0,X1] :
( ~ theorem(implies(X0,X1))
| theorem(or(X2,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f326,f8]) ).
fof(f326,plain,
! [X2,X0,X1] :
( theorem(implies(X0,or(X1,X2)))
| ~ theorem(implies(X0,X2)) ),
inference(forward_demodulation,[],[f325,f6]) ).
fof(f325,plain,
! [X2,X0,X1] :
( theorem(implies(X0,or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ),
inference(superposition,[],[f250,f6]) ).
fof(f250,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f95,f18]) ).
fof(f18,plain,
! [X0,X1] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(resolution,[],[f15,f2]) ).
fof(f251,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ axiom(or(X1,or(X0,X2))) ),
inference(resolution,[],[f95,f7]) ).
fof(f5404,plain,
~ theorem(or(implies(p,not(q)),and(p,q))),
inference(resolution,[],[f5375,f27]) ).
fof(f27,plain,
~ theorem(implies(not(and(p,q)),implies(p,not(q)))),
inference(forward_demodulation,[],[f10,f6]) ).
fof(f10,axiom,
~ theorem(implies(not(and(p,q)),or(not(p),not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f5375,plain,
! [X0,X1] :
( theorem(implies(not(X1),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f2492,f68]) ).
fof(f68,plain,
! [X0,X1] :
( ~ theorem(or(X0,not(X1)))
| theorem(implies(X1,X0)) ),
inference(resolution,[],[f12,f15]) ).
fof(f12,plain,
! [X0,X1] : axiom(implies(or(X1,not(X0)),implies(X0,X1))),
inference(superposition,[],[f3,f6]) ).
fof(f2492,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f372,f1140]) ).
fof(f1140,plain,
! [X0] : theorem(implies(X0,not(not(X0)))),
inference(resolution,[],[f1130,f79]) ).
fof(f79,plain,
! [X0,X1] :
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[],[f68,f6]) ).
fof(f1130,plain,
! [X0] : theorem(implies(X0,X0)),
inference(resolution,[],[f1076,f2]) ).
fof(f1076,plain,
! [X0,X1] :
( ~ axiom(implies(X0,or(X1,X1)))
| theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f1075,f6]) ).
fof(f1075,plain,
! [X0,X1] :
( ~ axiom(implies(X0,or(X1,X1)))
| theorem(or(not(X0),X1)) ),
inference(superposition,[],[f1062,f6]) ).
fof(f372,plain,
! [X2,X0,X1] :
( ~ theorem(implies(X0,X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f126,f8]) ).
fof(f126,plain,
! [X2,X0,X1] :
( theorem(implies(or(X2,X0),or(X2,X1)))
| ~ theorem(implies(X0,X1)) ),
inference(resolution,[],[f5,f15]) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL235-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 14:00:49 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (4052)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (4057)WARNING: value z3 for option sas not known
% 0.14/0.38 % (4058)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (4054)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (4055)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (4060)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.14/0.38 % (4059)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.14/0.38 % (4057)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.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 % (4061)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.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.39 TRYING [4]
% 0.14/0.39 TRYING [4]
% 0.21/0.44 TRYING [5]
% 0.21/0.45 TRYING [5]
% 0.21/0.60 % (4057)First to succeed.
% 0.21/0.60 % (4057)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4052"
% 0.21/0.60 % (4057)Refutation found. Thanks to Tanya!
% 0.21/0.60 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.60 % (4057)------------------------------
% 0.21/0.60 % (4057)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.60 % (4057)Termination reason: Refutation
% 0.21/0.60
% 0.21/0.60 % (4057)Memory used [KB]: 2649
% 0.21/0.60 % (4057)Time elapsed: 0.224 s
% 0.21/0.60 % (4057)Instructions burned: 387 (million)
% 0.21/0.60 % (4052)Success in time 0.231 s
%------------------------------------------------------------------------------