TSTP Solution File: LCL068-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL068-1 : TPTP v8.1.2. Bugfixed v1.2.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:40:22 EDT 2024
% Result : Unsatisfiable 3.13s 0.83s
% Output : Refutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 18 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 26 ~; 25 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 72 ( 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12763,plain,
$false,
inference(avatar_sat_refutation,[],[f94,f544,f12762]) ).
fof(f12762,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f12678]) ).
fof(f12678,plain,
( $false
| spl0_6 ),
inference(resolution,[],[f12563,f93]) ).
fof(f93,plain,
( ~ is_a_theorem(implies(not(not(a)),a))
| spl0_6 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f91,plain,
( spl0_6
<=> is_a_theorem(implies(not(not(a)),a)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
fof(f12563,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
inference(resolution,[],[f12415,f298]) ).
fof(f298,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),implies(X1,X0)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f152,f2]) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_19) ).
fof(f152,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X0),X1))
| ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f60,f8]) ).
fof(f8,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(resolution,[],[f6,f2]) ).
fof(f6,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X0),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f2,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(f60,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X0,X2))
| is_a_theorem(X1) ),
inference(resolution,[],[f24,f1]) ).
fof(f24,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X2),X1))
| ~ is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(resolution,[],[f13,f1]) ).
fof(f13,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),X1)))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(resolution,[],[f4,f1]) ).
fof(f4,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X0),X2),implies(implies(X1,X2),implies(implies(X0,X1),X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_59) ).
fof(f12415,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(resolution,[],[f12101,f559]) ).
fof(f559,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f114,f2]) ).
fof(f114,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X3,X1),X0))
| ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f60,f17]) ).
fof(f17,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),implies(X1,X2))),
inference(resolution,[],[f7,f2]) ).
fof(f7,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X2),X1))
| is_a_theorem(implies(not(X0),X1)) ),
inference(resolution,[],[f3,f1]) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_37) ).
fof(f12101,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X1),X2)))),
inference(resolution,[],[f872,f25]) ).
fof(f25,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(not(X0),implies(X1,implies(X2,implies(X0,X3))))),
inference(resolution,[],[f10,f7]) ).
fof(f10,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X0)))),
inference(resolution,[],[f8,f6]) ).
fof(f872,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(not(X0)),implies(X1,implies(X0,X2))))
| is_a_theorem(implies(X1,implies(X0,X2))) ),
inference(resolution,[],[f157,f2]) ).
fof(f157,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,implies(X0,X3)),X1))
| ~ is_a_theorem(implies(not(not(X0)),X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f60,f20]) ).
fof(f20,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(X0),implies(X1,implies(X0,X2)))),
inference(resolution,[],[f7,f8]) ).
fof(f544,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f543]) ).
fof(f543,plain,
( $false
| spl0_5 ),
inference(resolution,[],[f519,f89]) ).
fof(f89,plain,
( ~ is_a_theorem(implies(a,a))
| spl0_5 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f87,plain,
( spl0_5
<=> is_a_theorem(implies(a,a)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f519,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f483,f298]) ).
fof(f483,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f298,f18]) ).
fof(f18,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),implies(not(X0),X2))),
inference(resolution,[],[f7,f3]) ).
fof(f94,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f57,f91,f87]) ).
fof(f57,plain,
( ~ is_a_theorem(implies(not(not(a)),a))
| ~ is_a_theorem(implies(a,a)) ),
inference(resolution,[],[f24,f5]) ).
fof(f5,axiom,
~ is_a_theorem(implies(implies(not(a),a),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL068-1 : TPTP v8.1.2. Bugfixed v1.2.0.
% 0.11/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n003.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 23:10:48 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (30011)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (30018)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.38 % (30014)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 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 % (30016)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.39 % (30017)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.39 % (30012)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.39 % (30013)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.39 % (30015)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.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [4]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [3]
% 0.15/0.40 TRYING [3]
% 0.15/0.40 TRYING [4]
% 0.15/0.40 TRYING [4]
% 0.15/0.40 TRYING [4]
% 0.22/0.42 TRYING [5]
% 0.22/0.42 TRYING [5]
% 0.22/0.42 TRYING [5]
% 0.22/0.42 TRYING [5]
% 0.22/0.54 TRYING [6]
% 0.22/0.55 TRYING [6]
% 0.22/0.55 TRYING [6]
% 0.22/0.55 TRYING [6]
% 3.13/0.82 % (30014)First to succeed.
% 3.13/0.83 % (30014)Refutation found. Thanks to Tanya!
% 3.13/0.83 % SZS status Unsatisfiable for theBenchmark
% 3.13/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 3.13/0.83 % (30014)------------------------------
% 3.13/0.83 % (30014)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 3.13/0.83 % (30014)Termination reason: Refutation
% 3.13/0.83
% 3.13/0.83 % (30014)Memory used [KB]: 3824
% 3.13/0.83 % (30014)Time elapsed: 0.445 s
% 3.13/0.83 % (30014)Instructions burned: 867 (million)
% 3.13/0.83 % (30014)------------------------------
% 3.13/0.83 % (30014)------------------------------
% 3.13/0.83 % (30011)Success in time 0.458 s
%------------------------------------------------------------------------------