TSTP Solution File: LCL201-3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL201-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:27 EDT 2024
% Result : Unsatisfiable 0.22s 0.64s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 15 unt; 0 def)
% Number of atoms : 80 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 77 ( 41 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 90 ( 90 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8102,plain,
$false,
inference(subsumption_resolution,[],[f8098,f552]) ).
fof(f552,plain,
! [X0] : theorem(implies(X0,X0)),
inference(resolution,[],[f548,f2]) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f548,plain,
! [X0,X1] :
( ~ axiom(implies(X0,or(X1,X1)))
| theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f547,f6]) ).
fof(f6,axiom,
! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f547,plain,
! [X0,X1] :
( ~ axiom(implies(X0,or(X1,X1)))
| theorem(or(not(X0),X1)) ),
inference(superposition,[],[f498,f6]) ).
fof(f498,plain,
! [X0,X1] :
( ~ axiom(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f121,f406]) ).
fof(f406,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X0)))
| theorem(or(X1,X0)) ),
inference(resolution,[],[f382,f27]) ).
fof(f27,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f18,f1]) ).
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f18,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/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X3,X4] :
( ~ theorem(implies(X4,X3))
| theorem(X3)
| ~ theorem(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f382,plain,
! [X2,X0,X1] :
( theorem(or(X1,or(X2,X0)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f287,f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(resolution,[],[f18,f4]) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f287,plain,
! [X2,X0,X1] :
( theorem(or(X2,or(X1,X0)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f261,f3]) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f261,plain,
! [X2,X0,X1] :
( ~ axiom(implies(X2,X1))
| ~ theorem(X2)
| theorem(or(X0,X1)) ),
inference(resolution,[],[f209,f7]) ).
fof(f209,plain,
! [X2,X0,X1] :
( ~ theorem(implies(X0,X1))
| theorem(or(X2,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f158,f8]) ).
fof(f158,plain,
! [X2,X0,X1] :
( theorem(implies(X0,or(X1,X2)))
| ~ theorem(implies(X0,X2)) ),
inference(forward_demodulation,[],[f157,f6]) ).
fof(f157,plain,
! [X2,X0,X1] :
( theorem(implies(X0,or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ),
inference(superposition,[],[f120,f6]) ).
fof(f120,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f29,f30]) ).
fof(f30,plain,
! [X0,X1] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(resolution,[],[f18,f2]) ).
fof(f121,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ axiom(or(X1,or(X0,X2))) ),
inference(resolution,[],[f29,f7]) ).
fof(f8098,plain,
~ theorem(implies(p,p)),
inference(resolution,[],[f8078,f7830]) ).
fof(f7830,plain,
! [X2,X0,X1] :
( theorem(implies(X0,or(X1,X2)))
| ~ theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f7829,f6]) ).
fof(f7829,plain,
! [X2,X0,X1] :
( theorem(implies(X0,or(X1,X2)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[],[f7782,f6]) ).
fof(f7782,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f1585,f3]) ).
fof(f1585,plain,
! [X2,X3,X0,X1] :
( ~ axiom(implies(or(X2,X3),X1))
| theorem(or(X0,X1))
| ~ theorem(or(X0,X3)) ),
inference(resolution,[],[f655,f120]) ).
fof(f655,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,X2))
| theorem(or(X0,X1))
| ~ axiom(implies(X2,X1)) ),
inference(resolution,[],[f139,f7]) ).
fof(f139,plain,
! [X2,X0,X1] :
( ~ theorem(implies(X0,X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f45,f8]) ).
fof(f45,plain,
! [X2,X0,X1] :
( theorem(implies(or(X2,X0),or(X2,X1)))
| ~ theorem(implies(X0,X1)) ),
inference(resolution,[],[f5,f18]) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f8078,plain,
~ theorem(implies(p,or(p,q))),
inference(forward_demodulation,[],[f8069,f6]) ).
fof(f8069,plain,
~ theorem(or(not(p),or(p,q))),
inference(resolution,[],[f8059,f843]) ).
fof(f843,plain,
! [X0,X1] :
( theorem(implies(not(X1),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f647,f70]) ).
fof(f70,plain,
! [X0,X1] :
( ~ theorem(or(X0,not(X1)))
| theorem(implies(X1,X0)) ),
inference(resolution,[],[f14,f18]) ).
fof(f14,plain,
! [X0,X1] : axiom(implies(or(X1,not(X0)),implies(X0,X1))),
inference(superposition,[],[f3,f6]) ).
fof(f647,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f139,f559]) ).
fof(f559,plain,
! [X0] : theorem(implies(X0,not(not(X0)))),
inference(resolution,[],[f552,f84]) ).
fof(f84,plain,
! [X0,X1] :
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[],[f70,f6]) ).
fof(f8059,plain,
~ theorem(implies(not(or(p,q)),not(p))),
inference(resolution,[],[f7830,f9]) ).
fof(f9,axiom,
~ theorem(implies(not(or(p,q)),or(not(p),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL201-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:30:19 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (20816)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (20819)WARNING: value z3 for option sas not known
% 0.15/0.38 % (20817)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (20818)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (20820)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (20819)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.15/0.38 % (20821)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.15/0.38 % (20822)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.15/0.38 % (20823)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.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [3]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [4]
% 0.15/0.40 TRYING [4]
% 0.22/0.43 TRYING [5]
% 0.22/0.45 TRYING [5]
% 0.22/0.54 TRYING [6]
% 0.22/0.63 TRYING [6]
% 0.22/0.63 % (20819)First to succeed.
% 0.22/0.63 % (20819)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20816"
% 0.22/0.64 % (20819)Refutation found. Thanks to Tanya!
% 0.22/0.64 % SZS status Unsatisfiable for theBenchmark
% 0.22/0.64 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.64 % (20819)------------------------------
% 0.22/0.64 % (20819)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.64 % (20819)Termination reason: Refutation
% 0.22/0.64
% 0.22/0.64 % (20819)Memory used [KB]: 3576
% 0.22/0.64 % (20819)Time elapsed: 0.256 s
% 0.22/0.64 % (20819)Instructions burned: 653 (million)
% 0.22/0.64 % (20816)Success in time 0.272 s
%------------------------------------------------------------------------------