TSTP Solution File: LCL116-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL116-1 : TPTP v8.1.2. Released v1.0.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 : Tue Apr 30 13:40:33 EDT 2024
% Result : Unsatisfiable 29.73s 4.59s
% Output : Refutation 29.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 32 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 16 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 106 ( 106 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f264207,plain,
$false,
inference(resolution,[],[f263316,f6]) ).
fof(f6,axiom,
~ is_a_theorem(implies(not(a),implies(b,not(implies(b,a))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_50) ).
fof(f263316,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X1,not(implies(X1,X0))))),
inference(resolution,[],[f261804,f29697]) ).
fof(f29697,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X0,X2)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f8330,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f8330,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f1154,f42]) ).
fof(f42,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(implies(X0,X1),X1),X2),implies(X0,X2))),
inference(resolution,[],[f34,f15]) ).
fof(f15,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(implies(X0,X1),implies(X2,X1))) ),
inference(resolution,[],[f3,f1]) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_2) ).
fof(f34,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(implies(X0,X1),X1))),
inference(resolution,[],[f26,f4]) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_3) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X0),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f19,f1]) ).
fof(f19,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
inference(resolution,[],[f15,f2]) ).
fof(f2,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_1) ).
fof(f1154,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(implies(X1,X3),implies(X0,X3)),X2))
| is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[],[f23,f1]) ).
fof(f23,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),X3),implies(implies(X2,X0),X3))),
inference(resolution,[],[f15,f3]) ).
fof(f261804,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X1),not(implies(X0,X1))))),
inference(resolution,[],[f27021,f90429]) ).
fof(f90429,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(not(implies(X0,X1))),not(not(X1))))),
inference(resolution,[],[f8730,f29697]) ).
fof(f8730,plain,
! [X0,X1] : is_a_theorem(implies(not(not(implies(X0,X1))),implies(X0,not(not(X1))))),
inference(resolution,[],[f8319,f2725]) ).
fof(f2725,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(not(not(X0)),X1)) ),
inference(resolution,[],[f1841,f1]) ).
fof(f1841,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(not(X0)),X1))),
inference(resolution,[],[f1823,f15]) ).
fof(f1823,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
inference(resolution,[],[f1707,f355]) ).
fof(f355,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X2),X1))
| is_a_theorem(implies(not(X0),X1)) ),
inference(resolution,[],[f35,f1]) ).
fof(f35,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
inference(resolution,[],[f28,f15]) ).
fof(f28,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f26,f5]) ).
fof(f5,axiom,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_5) ).
fof(f1707,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(implies(X1,X1))),X0)),
inference(resolution,[],[f1450,f111]) ).
fof(f111,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X1),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f98,f1]) ).
fof(f98,plain,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X0),X1),X1)),
inference(resolution,[],[f87,f43]) ).
fof(f43,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[],[f34,f1]) ).
fof(f87,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f84,f26]) ).
fof(f84,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(X1,X0)),X2),X2)),
inference(resolution,[],[f17,f8]) ).
fof(f8,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f7,f2]) ).
fof(f7,plain,
! [X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f1,f2]) ).
fof(f17,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X0),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[],[f4,f1]) ).
fof(f1450,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(implies(not(X1),not(X0)),X1))),
inference(resolution,[],[f902,f22]) ).
fof(f22,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(not(X1),not(X0)),X2))),
inference(resolution,[],[f15,f5]) ).
fof(f902,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(implies(X0,X2),X2),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f42,f1]) ).
fof(f8319,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(X0,not(not(X1))))),
inference(resolution,[],[f1154,f1870]) ).
fof(f1870,plain,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,not(not(X0))),X1),X1)),
inference(resolution,[],[f1840,f43]) ).
fof(f1840,plain,
! [X0] : is_a_theorem(implies(X0,not(not(X0)))),
inference(resolution,[],[f1823,f11]) ).
fof(f11,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X1),not(X0)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f5,f1]) ).
fof(f27021,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X2),not(X1))))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f8324,f1]) ).
fof(f8324,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),not(X2))),implies(X0,implies(X2,X1)))),
inference(resolution,[],[f1154,f280]) ).
fof(f280,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(implies(not(X0),not(X1)),implies(X1,X0)),X2),X2)),
inference(resolution,[],[f12,f17]) ).
fof(f12,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(not(X1),not(X2)),implies(X2,X1)))),
inference(resolution,[],[f5,f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL116-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/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 : Mon Apr 29 22:42:16 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (27384)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (27388)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.38 % (27390)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.38 % (27389)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.38 % (27386)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (27385)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38 % (27387)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.15/0.38 % (27391)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.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [4]
% 0.15/0.40 TRYING [4]
% 0.15/0.40 TRYING [4]
% 0.15/0.40 TRYING [4]
% 0.15/0.43 TRYING [5]
% 0.15/0.43 TRYING [5]
% 0.15/0.43 TRYING [5]
% 0.21/0.44 TRYING [5]
% 1.96/0.63 TRYING [6]
% 1.96/0.63 TRYING [6]
% 2.15/0.65 TRYING [6]
% 2.15/0.70 TRYING [6]
% 9.99/1.78 TRYING [7]
% 9.99/1.78 TRYING [7]
% 10.31/1.86 TRYING [7]
% 11.44/2.05 TRYING [7]
% 29.50/4.58 % (27389)First to succeed.
% 29.73/4.59 % (27389)Refutation found. Thanks to Tanya!
% 29.73/4.59 % SZS status Unsatisfiable for theBenchmark
% 29.73/4.59 % SZS output start Proof for theBenchmark
% See solution above
% 29.73/4.59 % (27389)------------------------------
% 29.73/4.59 % (27389)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 29.73/4.59 % (27389)Termination reason: Refutation
% 29.73/4.59
% 29.73/4.59 % (27389)Memory used [KB]: 82288
% 29.73/4.59 % (27389)Time elapsed: 4.199 s
% 29.73/4.59 % (27389)Instructions burned: 15215 (million)
% 29.73/4.59 % (27389)------------------------------
% 29.73/4.59 % (27389)------------------------------
% 29.73/4.59 % (27384)Success in time 4.159 s
%------------------------------------------------------------------------------