TSTP Solution File: LCL542+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL542+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 : n016.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:44:18 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% 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 : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 31 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f286,plain,
$false,
inference(resolution,[],[f270,f224]) ).
fof(f224,plain,
~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)),
inference(subsumption_resolution,[],[f197,f161]) ).
fof(f161,plain,
~ axiom_m2,
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
~ axiom_m2,
inference(flattening,[],[f90]) ).
fof(f90,negated_conjecture,
~ axiom_m2,
inference(negated_conjecture,[],[f89]) ).
fof(f89,conjecture,
axiom_m2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m2) ).
fof(f197,plain,
( axiom_m2
| ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)) ),
inference(cnf_transformation,[],[f160]) ).
fof(f160,plain,
( axiom_m2
| ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f137,f159]) ).
fof(f159,plain,
( ? [X0,X1] : ~ is_a_theorem(strict_implies(and(X0,X1),X0))
=> ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
( axiom_m2
| ? [X0,X1] : ~ is_a_theorem(strict_implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f106]) ).
fof(f106,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0))
=> axiom_m2 ),
inference(unused_predicate_definition_removal,[],[f64]) ).
fof(f64,axiom,
( axiom_m2
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m2) ).
fof(f270,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)),
inference(forward_demodulation,[],[f268,f218]) ).
fof(f218,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(subsumption_resolution,[],[f191,f184]) ).
fof(f184,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f86,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f191,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,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/sandbox2/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f268,plain,
! [X0,X1] : is_a_theorem(necessarily(implies(and(X0,X1),X0))),
inference(unit_resulting_resolution,[],[f232,f228]) ).
fof(f228,plain,
! [X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) ),
inference(subsumption_resolution,[],[f201,f166]) ).
fof(f166,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',km4b_necessitation) ).
fof(f201,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f111]) ).
fof(f111,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/sandbox2/benchmark/theBenchmark.p',necessitation) ).
fof(f232,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(subsumption_resolution,[],[f205,f175]) ).
fof(f175,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f205,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(ennf_transformation,[],[f120]) ).
fof(f120,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL542+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Apr 29 23:10:55 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (22910)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (22913)WARNING: value z3 for option sas not known
% 0.14/0.37 % (22913)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.14/0.37 % (22914)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37 % (22912)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37 % (22911)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37 % (22915)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.14/0.37 % (22917)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.14/0.38 % (22916)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.14/0.38 % (22917)First to succeed.
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 % (22913)Also succeeded, but the first one will report.
% 0.14/0.38 % (22917)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (22917)------------------------------
% 0.14/0.38 % (22917)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.38 % (22917)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (22917)Memory used [KB]: 977
% 0.14/0.38 % (22917)Time elapsed: 0.005 s
% 0.14/0.38 % (22917)Instructions burned: 6 (million)
% 0.14/0.38 % (22917)------------------------------
% 0.14/0.38 % (22917)------------------------------
% 0.14/0.38 % (22910)Success in time 0.014 s
%------------------------------------------------------------------------------