TSTP Solution File: LCL536+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL536+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n002.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:47:34 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 16 unt; 0 def)
% Number of atoms : 56 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 18 ~; 12 |; 0 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f285,plain,
$false,
inference(resolution,[],[f281,f219]) ).
fof(f219,plain,
~ is_a_theorem(strict_implies(possibly(sK0),necessarily(possibly(sK0)))),
inference(subsumption_resolution,[],[f193,f158]) ).
fof(f158,plain,
~ axiom_m10,
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
~ axiom_m10,
inference(flattening,[],[f89]) ).
fof(f89,negated_conjecture,
~ axiom_m10,
inference(negated_conjecture,[],[f88]) ).
fof(f88,conjecture,
axiom_m10,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_m10_axiom_m10) ).
fof(f193,plain,
( axiom_m10
| ~ is_a_theorem(strict_implies(possibly(sK0),necessarily(possibly(sK0)))) ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
( axiom_m10
| ~ is_a_theorem(strict_implies(possibly(sK0),necessarily(possibly(sK0)))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f135,f156]) ).
fof(f156,plain,
( ? [X0] : ~ is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0))))
=> ~ is_a_theorem(strict_implies(possibly(sK0),necessarily(possibly(sK0)))) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( axiom_m10
| ? [X0] : ~ is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0)))) ),
inference(ennf_transformation,[],[f105]) ).
fof(f105,plain,
( ! [X0] : is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0))))
=> axiom_m10 ),
inference(unused_predicate_definition_removal,[],[f72]) ).
fof(f72,axiom,
( axiom_m10
<=> ! [X0] : is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m10) ).
fof(f281,plain,
! [X0] : is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0)))),
inference(forward_demodulation,[],[f279,f213]) ).
fof(f213,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(subsumption_resolution,[],[f187,f180]) ).
fof(f180,plain,
op_strict_implies,
inference(cnf_transformation,[],[f85]) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f187,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f279,plain,
! [X0] : is_a_theorem(necessarily(implies(possibly(X0),necessarily(possibly(X0))))),
inference(unit_resulting_resolution,[],[f221,f222]) ).
fof(f222,plain,
! [X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) ),
inference(subsumption_resolution,[],[f196,f162]) ).
fof(f162,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km5_necessitation) ).
fof(f196,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f109]) ).
fof(f109,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',necessitation) ).
fof(f221,plain,
! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))),
inference(subsumption_resolution,[],[f195,f159]) ).
fof(f159,plain,
axiom_5,
inference(cnf_transformation,[],[f81]) ).
fof(f81,axiom,
axiom_5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km5_axiom_5) ).
fof(f195,plain,
! [X0] :
( is_a_theorem(implies(possibly(X0),necessarily(possibly(X0))))
| ~ axiom_5 ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
( ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0))))
| ~ axiom_5 ),
inference(ennf_transformation,[],[f106]) ).
fof(f106,plain,
( axiom_5
=> ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f58,axiom,
( axiom_5
<=> ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL536+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 14:12:12 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % (5863)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37 % (5866)WARNING: value z3 for option sas not known
% 0.13/0.37 % (5865)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37 % (5864)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37 % (5867)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37 % (5868)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.13/0.37 % (5866)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37 % (5869)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.13/0.37 % (5870)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.37 TRYING [1]
% 0.13/0.37 % (5870)First to succeed.
% 0.13/0.37 TRYING [2]
% 0.13/0.37 % (5870)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5863"
% 0.13/0.37 % (5866)Also succeeded, but the first one will report.
% 0.13/0.37 % (5870)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (5870)------------------------------
% 0.13/0.37 % (5870)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37 % (5870)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (5870)Memory used [KB]: 1021
% 0.13/0.37 % (5870)Time elapsed: 0.005 s
% 0.13/0.37 % (5870)Instructions burned: 6 (million)
% 0.13/0.37 % (5863)Success in time 0.012 s
%------------------------------------------------------------------------------