TSTP Solution File: LCL107-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL107-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 : n028.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:03 EDT 2024
% Result : Unsatisfiable 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 16 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 121 ( 121 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f534,plain,
$false,
inference(resolution,[],[f210,f3]) ).
fof(f3,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p_1) ).
fof(f210,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
inference(resolution,[],[f177,f112]) ).
fof(f112,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3))),
inference(resolution,[],[f111,f4]) ).
fof(f4,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X1),X0),equivalent(equivalent(X4,X5),equivalent(equivalent(equivalent(X6,X5),equivalent(X6,X4)),X3))))
| is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),X3))) ),
inference(resolution,[],[f2,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X6,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))),equivalent(X2,equivalent(equivalent(X1,X0),X6)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_27_1690) ).
fof(f111,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(resolution,[],[f110,f40]) ).
fof(f40,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X3),equivalent(equivalent(X0,equivalent(equivalent(X4,X1),equivalent(X4,X2))),X3))),
inference(resolution,[],[f30,f5]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X6,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(X2,X1),equivalent(X2,X0)),X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X4),equivalent(X6,X5))),X3))),
inference(resolution,[],[f4,f2]) ).
fof(f30,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X4,equivalent(equivalent(X5,X0),equivalent(X5,X1)))),equivalent(X3,equivalent(X4,X2))))
| is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[],[f18,f1]) ).
fof(f18,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4)))),equivalent(X0,equivalent(X1,X5))),equivalent(equivalent(X3,X4),X5))),
inference(resolution,[],[f14,f2]) ).
fof(f14,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,equivalent(X3,X5)))),equivalent(X1,equivalent(X4,X5))),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f11,f1]) ).
fof(f11,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4)))),equivalent(X0,equivalent(X3,X4))),X5),X5)),
inference(resolution,[],[f9,f6]) ).
fof(f6,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)),equivalent(equivalent(X1,X2),X7))),
inference(resolution,[],[f5,f4]) ).
fof(f9,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),equivalent(equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(X5,X7))),equivalent(X4,equivalent(X6,X7))),X2)))
| is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[],[f6,f1]) ).
fof(f110,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X0)))
| is_a_theorem(X0) ),
inference(resolution,[],[f98,f1]) ).
fof(f98,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
inference(resolution,[],[f82,f44]) ).
fof(f44,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(equivalent(X3,X0),equivalent(equivalent(X4,X3),equivalent(X4,X1))),X2))),
inference(resolution,[],[f40,f9]) ).
fof(f82,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(equivalent(X2,X0),equivalent(equivalent(X3,equivalent(X4,X2)),equivalent(X3,equivalent(X4,X1)))))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f78,f1]) ).
fof(f78,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,equivalent(X3,X0)),equivalent(X2,equivalent(X3,X4)))),equivalent(X1,X4))),
inference(resolution,[],[f75,f40]) ).
fof(f75,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X4))),equivalent(X2,X4)),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f65,f1]) ).
fof(f65,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X3))),equivalent(X1,X3)),X4),X4)),
inference(resolution,[],[f8,f9]) ).
fof(f8,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)),equivalent(equivalent(equivalent(X8,X5),equivalent(X8,X6)),X7))),
inference(resolution,[],[f6,f4]) ).
fof(f177,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),X2))
| is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[],[f112,f1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL107-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 13:58:33 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (11258)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.36 % (11262)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 % (11260)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (11261)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 % (11263)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37 % (11264)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37 % (11259)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 % (11265)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.37 TRYING [1]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [3]
% 0.14/0.37 TRYING [3]
% 0.14/0.37 TRYING [3]
% 0.14/0.37 TRYING [3]
% 0.14/0.38 % (11263)First to succeed.
% 0.14/0.39 % (11263)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11258"
% 0.14/0.39 % (11263)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (11263)------------------------------
% 0.14/0.39 % (11263)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.39 % (11263)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (11263)Memory used [KB]: 975
% 0.14/0.39 % (11263)Time elapsed: 0.021 s
% 0.14/0.39 % (11263)Instructions burned: 33 (million)
% 0.14/0.39 % (11258)Success in time 0.034 s
%------------------------------------------------------------------------------