TSTP Solution File: LCL542+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL542+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n004.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 : Wed Aug 31 17:48:40 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 49 ( 20 unt; 3 typ; 0 def)
% Number of atoms : 77 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 28 ~; 19 |; 0 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 38 !; 6 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_62,type,
sQ3_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_63,type,
sQ4_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_64,type,
sQ5_eqProxy: ( $real * $real ) > $o ).
fof(f375,plain,
$false,
inference(subsumption_resolution,[],[f374,f347]) ).
fof(f347,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,X0),X1)),
inference(subsumption_resolution,[],[f280,f299]) ).
fof(f299,plain,
and_1,
inference(literal_reordering,[],[f199]) ).
fof(f199,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f280,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X1,X0),X1))
| ~ and_1 ),
inference(literal_reordering,[],[f235]) ).
fof(f235,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X1,X0),X1))
| ~ and_1 ),
inference(cnf_transformation,[],[f155]) ).
fof(f155,plain,
( ~ and_1
| ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X1)) ),
inference(ennf_transformation,[],[f140]) ).
fof(f140,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X1)) ),
inference(unused_predicate_definition_removal,[],[f111]) ).
fof(f111,plain,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X1,X0),X1)) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
( and_1
<=> ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_1) ).
fof(f374,plain,
~ is_a_theorem(implies(and(sK1,sK0),sK1)),
inference(resolution,[],[f372,f343]) ).
fof(f343,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ),
inference(subsumption_resolution,[],[f257,f269]) ).
fof(f269,plain,
necessitation,
inference(literal_reordering,[],[f215]) ).
fof(f215,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_necessitation) ).
fof(f257,plain,
! [X0] :
( ~ necessitation
| ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) ),
inference(literal_reordering,[],[f245]) ).
fof(f245,plain,
! [X0] :
( ~ necessitation
| ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) ),
inference(cnf_transformation,[],[f172]) ).
fof(f172,plain,
( ! [X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) )
| ~ necessitation ),
inference(ennf_transformation,[],[f131]) ).
fof(f131,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f50,axiom,
( ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) )
<=> necessitation ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',necessitation) ).
fof(f372,plain,
~ is_a_theorem(necessarily(implies(and(sK1,sK0),sK1))),
inference(backward_demodulation,[],[f346,f370]) ).
fof(f370,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(subsumption_resolution,[],[f289,f291]) ).
fof(f291,plain,
op_strict_implies,
inference(literal_reordering,[],[f212]) ).
fof(f212,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f86,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f289,plain,
! [X0,X1] :
( ~ op_strict_implies
| strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
inference(literal_reordering,[],[f223]) ).
fof(f223,plain,
! [X0,X1] :
( ~ op_strict_implies
| strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
inference(cnf_transformation,[],[f182]) ).
fof(f182,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(rectify,[],[f156]) ).
fof(f156,plain,
( ! [X1,X0] : strict_implies(X1,X0) = necessarily(implies(X1,X0))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f96]) ).
fof(f96,plain,
( op_strict_implies
=> ! [X1,X0] : strict_implies(X1,X0) = necessarily(implies(X1,X0)) ),
inference(rectify,[],[f75]) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X1,X0] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f346,plain,
~ is_a_theorem(strict_implies(and(sK1,sK0),sK1)),
inference(subsumption_resolution,[],[f275,f259]) ).
fof(f259,plain,
~ axiom_m2,
inference(literal_reordering,[],[f203]) ).
fof(f203,plain,
~ axiom_m2,
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
~ axiom_m2,
inference(flattening,[],[f90]) ).
fof(f90,negated_conjecture,
~ axiom_m2,
inference(negated_conjecture,[],[f89]) ).
fof(f89,conjecture,
axiom_m2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m2) ).
fof(f275,plain,
( ~ is_a_theorem(strict_implies(and(sK1,sK0),sK1))
| axiom_m2 ),
inference(literal_reordering,[],[f227]) ).
fof(f227,plain,
( ~ is_a_theorem(strict_implies(and(sK1,sK0),sK1))
| axiom_m2 ),
inference(cnf_transformation,[],[f188]) ).
fof(f188,plain,
( ~ is_a_theorem(strict_implies(and(sK1,sK0),sK1))
| axiom_m2 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f186,f187]) ).
fof(f187,plain,
( ? [X0,X1] : ~ is_a_theorem(strict_implies(and(X1,X0),X1))
=> ~ is_a_theorem(strict_implies(and(sK1,sK0),sK1)) ),
introduced(choice_axiom,[]) ).
fof(f186,plain,
( ? [X0,X1] : ~ is_a_theorem(strict_implies(and(X1,X0),X1))
| axiom_m2 ),
inference(rectify,[],[f169]) ).
fof(f169,plain,
( ? [X1,X0] : ~ is_a_theorem(strict_implies(and(X0,X1),X0))
| axiom_m2 ),
inference(ennf_transformation,[],[f126]) ).
fof(f126,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/sandbox/benchmark/theBenchmark.p',axiom_m2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL542+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 02:04:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 % (31134)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.48 % (31134)First to succeed.
% 0.20/0.49 % (31147)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.50 % (31134)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (31134)------------------------------
% 0.20/0.50 % (31134)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (31134)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (31134)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (31134)Memory used [KB]: 6012
% 0.20/0.50 % (31134)Time elapsed: 0.009 s
% 0.20/0.50 % (31134)Instructions burned: 6 (million)
% 0.20/0.50 % (31134)------------------------------
% 0.20/0.50 % (31134)------------------------------
% 0.20/0.50 % (31118)Success in time 0.139 s
%------------------------------------------------------------------------------