TSTP Solution File: LCL223-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL223-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n003.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 Apr 30 13:41:05 EDT 2024
% Result : Unsatisfiable 132.36s 19.33s
% Output : Refutation 132.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 36 ~; 23 |; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f193540,plain,
$false,
inference(resolution,[],[f193537,f2]) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f193537,plain,
~ axiom(or(not(p),or(r,p))),
inference(resolution,[],[f193348,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(f193348,plain,
! [X0] :
( ~ axiom(or(not(X0),or(p,r)))
| ~ axiom(or(not(p),X0)) ),
inference(resolution,[],[f192743,f6]) ).
fof(f6,axiom,
! [X3] :
( theorem(X3)
| ~ axiom(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f192743,plain,
! [X0] :
( ~ theorem(or(not(X0),or(p,r)))
| ~ axiom(or(not(p),X0)) ),
inference(resolution,[],[f192656,f8]) ).
fof(f8,axiom,
! [X3,X4,X5] :
( theorem(or(not(X3),X5))
| ~ axiom(or(not(X3),X4))
| ~ theorem(or(not(X4),X5)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_3) ).
fof(f192656,plain,
~ theorem(or(not(p),or(p,r))),
inference(resolution,[],[f192582,f802]) ).
fof(f802,plain,
! [X0,X1] :
( theorem(or(not(or(X0,X1)),X0))
| ~ theorem(or(not(X1),X0)) ),
inference(resolution,[],[f359,f20]) ).
fof(f20,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f5,f7]) ).
fof(f7,axiom,
! [X3,X4] :
( ~ axiom(or(not(X4),X3))
| theorem(X3)
| ~ theorem(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f359,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f135,f14]) ).
fof(f14,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(f135,plain,
! [X0,X1] :
( ~ theorem(or(X1,or(X0,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f47,f11]) ).
fof(f11,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[],[f7,f3]) ).
fof(f47,plain,
! [X0,X1] :
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f31,f12]) ).
fof(f12,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f7,f2]) ).
fof(f31,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(or(X0,X1),X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f14,f10]) ).
fof(f10,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(f192582,plain,
~ theorem(or(not(or(or(p,r),p)),or(p,r))),
inference(resolution,[],[f26205,f3]) ).
fof(f26205,plain,
! [X0] :
( ~ axiom(or(not(or(p,or(p,r))),X0))
| ~ theorem(or(not(X0),or(p,r))) ),
inference(resolution,[],[f26197,f8]) ).
fof(f26197,plain,
~ theorem(or(not(or(p,or(p,r))),or(p,r))),
inference(resolution,[],[f4030,f5]) ).
fof(f4030,plain,
! [X0] :
( ~ axiom(or(not(or(not(q),or(p,r))),or(not(or(p,q)),X0)))
| ~ theorem(or(not(X0),or(p,r))) ),
inference(resolution,[],[f1336,f20]) ).
fof(f1336,plain,
! [X0] :
( ~ theorem(or(not(X0),or(not(or(p,q)),or(p,r))))
| ~ axiom(or(not(or(not(q),or(p,r))),X0)) ),
inference(resolution,[],[f226,f4]) ).
fof(f226,plain,
! [X0,X1] :
( ~ axiom(or(not(or(p,or(not(q),r))),X0))
| ~ axiom(or(not(X0),X1))
| ~ theorem(or(not(X1),or(not(or(p,q)),or(p,r)))) ),
inference(resolution,[],[f67,f8]) ).
fof(f67,plain,
! [X0] :
( ~ theorem(or(not(X0),or(not(or(p,q)),or(p,r))))
| ~ axiom(or(not(or(p,or(not(q),r))),X0)) ),
inference(resolution,[],[f32,f8]) ).
fof(f32,plain,
~ theorem(or(not(or(p,or(not(q),r))),or(not(or(p,q)),or(p,r)))),
inference(resolution,[],[f14,f9]) ).
fof(f9,axiom,
~ theorem(or(not(or(p,q)),or(not(or(p,or(not(q),r))),or(p,r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL223-1 : TPTP v8.1.2. Released v1.1.0.
% 0.10/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n003.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.35 % DateTime : Mon Apr 29 22:52:03 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (3417)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (3421)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.37 % (3418)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 % (3420)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.14/0.37 % (3419)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (3423)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37 % (3422)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37 % (3424)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.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [1]
% 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 TRYING [2]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.41 TRYING [4]
% 0.14/0.41 TRYING [4]
% 0.14/0.41 TRYING [4]
% 0.14/0.41 TRYING [4]
% 2.50/0.74 TRYING [5]
% 2.50/0.74 TRYING [5]
% 2.50/0.75 TRYING [5]
% 2.98/0.81 TRYING [5]
% 14.28/2.40 TRYING [6]
% 14.28/2.40 TRYING [6]
% 14.28/2.44 TRYING [6]
% 14.28/2.45 TRYING [6]
% 132.36/19.32 % (3420)First to succeed.
% 132.36/19.33 % (3420)Refutation found. Thanks to Tanya!
% 132.36/19.33 % SZS status Unsatisfiable for theBenchmark
% 132.36/19.33 % SZS output start Proof for theBenchmark
% See solution above
% 132.36/19.33 % (3420)------------------------------
% 132.36/19.33 % (3420)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 132.36/19.33 % (3420)Termination reason: Refutation
% 132.36/19.33
% 132.36/19.33 % (3420)Memory used [KB]: 57936
% 132.36/19.33 % (3420)Time elapsed: 18.944 s
% 132.36/19.33 % (3420)Instructions burned: 51326 (million)
% 132.36/19.33 % (3420)------------------------------
% 132.36/19.33 % (3420)------------------------------
% 132.36/19.33 % (3417)Success in time 18.952 s
%------------------------------------------------------------------------------