TSTP Solution File: LCL399-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL399-1 : 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:45:32 EDT 2024
% Result : Unsatisfiable 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 19 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 5 ( 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 : 54 ( 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6141,plain,
$false,
inference(resolution,[],[f6093,f5]) ).
fof(f5,axiom,
~ is_a_theorem(implies(implies(not(x),not(implies(y,y))),x)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_65) ).
fof(f6093,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(implies(X1,X1))),X0)),
inference(resolution,[],[f5971,f19]) ).
fof(f19,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f18,f3]) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f8,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(f8,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(implies(X2,X0)) ),
inference(resolution,[],[f2,f1]) ).
fof(f2,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',cn_1) ).
fof(f5971,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(implies(X1,X1))),implies(X0,X2))),
inference(resolution,[],[f781,f157]) ).
fof(f157,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f49,f2]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(implies(not(X1),X2),X3)))
| is_a_theorem(implies(X0,implies(X1,X3))) ),
inference(resolution,[],[f21,f4]) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
fof(f21,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X0,implies(X3,X2)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f18,f8]) ).
fof(f781,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(implies(X2,X2),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f41,f224]) ).
fof(f224,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X1))),
inference(resolution,[],[f187,f26]) ).
fof(f26,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f19,f4]) ).
fof(f187,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f180,f19]) ).
fof(f180,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f53,f4]) ).
fof(f53,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,implies(not(X3),X2)))
| ~ is_a_theorem(X3) ),
inference(resolution,[],[f21,f7]) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f4]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X2,implies(X1,X0))) ),
inference(resolution,[],[f24,f18]) ).
fof(f24,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(implies(not(X1),X0)) ),
inference(resolution,[],[f19,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL399-1 : 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.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 13:47:19 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 % (5095)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.36 % (5102)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.37 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.15/0.37 TRYING [3]
% 0.15/0.37 % (5096)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.37 % (5101)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.37 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.15/0.37 TRYING [3]
% 0.15/0.37 TRYING [4]
% 0.15/0.37 % (5098)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.37 TRYING [4]
% 0.15/0.38 % (5100)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.38 % (5099)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 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [3]
% 0.15/0.39 TRYING [4]
% 0.15/0.39 % (5097)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [5]
% 0.15/0.40 TRYING [4]
% 0.21/0.40 TRYING [5]
% 0.21/0.42 TRYING [5]
% 0.21/0.43 TRYING [5]
% 0.21/0.55 % (5101)First to succeed.
% 0.21/0.55 % (5101)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5095"
% 0.21/0.55 % (5101)Refutation found. Thanks to Tanya!
% 0.21/0.55 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.55 % (5101)------------------------------
% 0.21/0.55 % (5101)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.55 % (5101)Termination reason: Refutation
% 0.21/0.55
% 0.21/0.55 % (5101)Memory used [KB]: 2789
% 0.21/0.55 % (5101)Time elapsed: 0.179 s
% 0.21/0.55 % (5101)Instructions burned: 439 (million)
% 0.21/0.55 % (5095)Success in time 0.196 s
%------------------------------------------------------------------------------