TSTP Solution File: LCL087-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL087-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 : n031.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:00 EDT 2024
% Result : Unsatisfiable 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 13 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 69 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f112,plain,
$false,
inference(resolution,[],[f101,f3]) ).
fof(f3,axiom,
~ is_a_theorem(implies(a,implies(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_2) ).
fof(f101,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(resolution,[],[f93,f24]) ).
fof(f24,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(X0,X1),implies(X2,X1)))),
inference(resolution,[],[f16,f2]) ).
fof(f2,axiom,
! [X2,X3,X6,X4,X5] : is_a_theorem(implies(implies(implies(X2,X3),implies(X4,X5)),implies(X6,implies(implies(X5,X2),implies(X4,X2))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz_4) ).
fof(f16,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X3)
| is_a_theorem(implies(X0,implies(implies(X0,X1),implies(X2,X1)))) ),
inference(resolution,[],[f13,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f13,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(implies(X1,X2),implies(X3,X2))))),
inference(resolution,[],[f11,f2]) ).
fof(f11,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(implies(X3,X1),implies(X4,X1)),implies(X1,X2)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f8,f1]) ).
fof(f8,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(resolution,[],[f6,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(X5)
| is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))) ),
inference(resolution,[],[f5,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(implies(X0,implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))),
inference(resolution,[],[f4,f2]) ).
fof(f4,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(X2,X4),implies(X3,X1)))
| is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X3,X2)))) ),
inference(resolution,[],[f2,f1]) ).
fof(f93,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(resolution,[],[f83,f1]) ).
fof(f83,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f74,f11]) ).
fof(f74,plain,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X1,X0))),
inference(resolution,[],[f67,f24]) ).
fof(f67,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X1,X0))) ),
inference(resolution,[],[f45,f1]) ).
fof(f45,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X2,X1)))),
inference(resolution,[],[f39,f4]) ).
fof(f39,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(X1,implies(X0,X1)))),
inference(resolution,[],[f20,f2]) ).
fof(f20,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(X0,X1),implies(X1,implies(X0,X1)))) ),
inference(resolution,[],[f15,f1]) ).
fof(f15,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X1,X2))))),
inference(resolution,[],[f11,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL087-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n031.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 14:07:17 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 % (23232)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (23239)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.37 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.15/0.37 TRYING [3]
% 0.15/0.37 % (23236)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.37 % (23240)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.37 % (23238)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 % (23242)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 % (23241)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.37 % (23237)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.37 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.15/0.37 TRYING [1]
% 0.15/0.37 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.15/0.37 TRYING [2]
% 0.15/0.37 TRYING [4]
% 0.15/0.37 TRYING [3]
% 0.15/0.37 % (23240)First to succeed.
% 0.15/0.38 % (23240)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-23232"
% 0.15/0.38 TRYING [3]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 % (23240)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38 % (23240)------------------------------
% 0.15/0.38 % (23240)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (23240)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (23240)Memory used [KB]: 759
% 0.15/0.38 % (23240)Time elapsed: 0.005 s
% 0.15/0.38 % (23240)Instructions burned: 6 (million)
% 0.15/0.38 % (23232)Success in time 0.02 s
%------------------------------------------------------------------------------