TSTP Solution File: LCL210-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL210-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue May 21 00:25:19 EDT 2024
% Result : Unsatisfiable 1.54s 0.59s
% Output : Refutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 25 ( 15 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5567,plain,
$false,
inference(resolution,[],[f5564,f9]) ).
fof(f9,axiom,
~ theorem(or(not(not(p)),or(not(or(p,q)),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f5564,plain,
! [X0,X1] : theorem(or(not(not(X0)),or(not(or(X0,X1)),X1))),
inference(resolution,[],[f5534,f4]) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f5534,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(or(not(or(X1,X2)),or(not(not(X1)),X2))),X0))
| theorem(X0) ),
inference(resolution,[],[f5528,f7]) ).
fof(f7,axiom,
! [X3,X4] :
( ~ theorem(X4)
| theorem(X3)
| ~ axiom(or(not(X4),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f5528,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(not(not(X0)),X1))),
inference(resolution,[],[f5521,f3]) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f5521,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(X0),or(X1,X2)))
| theorem(or(not(X0),or(not(not(X2)),X1))) ),
inference(resolution,[],[f5518,f8]) ).
fof(f8,axiom,
! [X3,X4,X5] :
( ~ theorem(or(not(X4),X5))
| ~ axiom(or(not(X3),X4))
| theorem(or(not(X3),X5)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3) ).
fof(f5518,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(not(not(X1)),X0))),
inference(resolution,[],[f5513,f4]) ).
fof(f5513,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(or(not(not(X1)),or(not(or(X2,X1)),X2))),X0))
| theorem(X0) ),
inference(resolution,[],[f5509,f7]) ).
fof(f5509,plain,
! [X0,X1] : theorem(or(not(not(X0)),or(not(or(X1,X0)),X1))),
inference(resolution,[],[f4440,f2]) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f4440,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(X0),or(X1,not(X2))))
| theorem(or(not(X0),or(not(or(X1,X2)),X1))) ),
inference(resolution,[],[f4435,f8]) ).
fof(f4435,plain,
! [X0,X1] : theorem(or(not(or(X0,not(X1))),or(not(or(X0,X1)),X0))),
inference(resolution,[],[f868,f3]) ).
fof(f868,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(X0),or(not(X1),X2)))
| theorem(or(not(X0),or(not(or(X2,X1)),X2))) ),
inference(resolution,[],[f862,f8]) ).
fof(f862,plain,
! [X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X1,X0)),X1))),
inference(resolution,[],[f76,f5]) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f76,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(X0),or(X1,or(X2,X2))))
| theorem(or(not(X0),or(X1,X2))) ),
inference(resolution,[],[f8,f38]) ).
fof(f38,plain,
! [X0,X1] : theorem(or(not(or(X0,or(X1,X1))),or(X0,X1))),
inference(resolution,[],[f5,f13]) ).
fof(f13,plain,
! [X0,X1] :
( ~ axiom(or(not(or(not(or(X1,X1)),X1)),X0))
| theorem(X0) ),
inference(resolution,[],[f7,f10]) ).
fof(f10,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f1,f6]) ).
fof(f6,axiom,
! [X3] :
( ~ axiom(X3)
| theorem(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f1,axiom,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL210-1 : TPTP v8.2.0. Released v1.1.0.
% 0.13/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.36 % Computer : n010.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon May 20 02:07:53 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.22/0.36 % (5704)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38 % (5705)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38 % (5709)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.22/0.38 % (5708)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.22/0.38 % (5711)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38 % (5710)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.22/0.38 % (5707)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [2]
% 0.22/0.38 TRYING [2]
% 0.22/0.38 TRYING [2]
% 0.22/0.39 TRYING [3]
% 0.22/0.39 TRYING [3]
% 0.22/0.39 TRYING [3]
% 0.22/0.39 % (5706)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.39 TRYING [1]
% 0.22/0.39 TRYING [2]
% 0.22/0.40 TRYING [3]
% 0.22/0.40 TRYING [4]
% 0.22/0.40 TRYING [4]
% 0.22/0.40 TRYING [4]
% 0.22/0.41 TRYING [4]
% 0.22/0.48 TRYING [5]
% 0.22/0.49 TRYING [5]
% 0.22/0.51 TRYING [5]
% 0.22/0.52 TRYING [5]
% 1.54/0.59 % (5709)First to succeed.
% 1.54/0.59 % (5709)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5704"
% 1.54/0.59 % (5709)Refutation found. Thanks to Tanya!
% 1.54/0.59 % SZS status Unsatisfiable for theBenchmark
% 1.54/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.54/0.59 % (5709)------------------------------
% 1.54/0.59 % (5709)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.59 % (5709)Termination reason: Refutation
% 1.54/0.59
% 1.54/0.59 % (5709)Memory used [KB]: 3219
% 1.54/0.59 % (5709)Time elapsed: 0.210 s
% 1.54/0.59 % (5709)Instructions burned: 325 (million)
% 1.54/0.59 % (5704)Success in time 0.226 s
%------------------------------------------------------------------------------