TSTP Solution File: SWV373+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV373+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n014.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 20:46:52 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 69 ( 14 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 65 ( 30 ~; 18 |; 10 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 57 ( 54 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [U] : ~ contains_slb(create_slb,U),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f27,axiom,
! [U,V,W,X] :
( contains_cpq(triple(U,V,W),X)
<=> contains_slb(V,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f39,axiom,
! [U,V,W,X] :
( V != create_slb
=> findmin_cpq_res(triple(U,V,W)) = findmin_pqp_res(U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f42,lemma,
! [U,V,W] :
( ok(findmin_cpq_eff(triple(U,V,W)))
=> ( V != create_slb
& contains_slb(V,findmin_pqp_res(U))
& less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f43,conjecture,
! [U,V,W] :
( ~ contains_cpq(triple(U,V,W),findmin_cpq_res(triple(U,V,W)))
=> ~ ok(findmin_cpq_eff(triple(U,V,W))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f44,negated_conjecture,
~ ! [U,V,W] :
( ~ contains_cpq(triple(U,V,W),findmin_cpq_res(triple(U,V,W)))
=> ~ ok(findmin_cpq_eff(triple(U,V,W))) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f58,plain,
! [X0] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f108,plain,
! [U,V,W,X] :
( ( ~ contains_cpq(triple(U,V,W),X)
| contains_slb(V,X) )
& ( contains_cpq(triple(U,V,W),X)
| ~ contains_slb(V,X) ) ),
inference(NNF_transformation,[status(esa)],[f27]) ).
fof(f109,plain,
( ! [V,X] :
( ! [U,W] : ~ contains_cpq(triple(U,V,W),X)
| contains_slb(V,X) )
& ! [V,X] :
( ! [U,W] : contains_cpq(triple(U,V,W),X)
| ~ contains_slb(V,X) ) ),
inference(miniscoping,[status(esa)],[f108]) ).
fof(f111,plain,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[status(esa)],[f109]) ).
fof(f140,plain,
! [U,V,W,X] :
( V = create_slb
| findmin_cpq_res(triple(U,V,W)) = findmin_pqp_res(U) ),
inference(pre_NNF_transformation,[status(esa)],[f39]) ).
fof(f141,plain,
! [V] :
( V = create_slb
| ! [U,W] : findmin_cpq_res(triple(U,V,W)) = findmin_pqp_res(U) ),
inference(miniscoping,[status(esa)],[f140]) ).
fof(f142,plain,
! [X0,X1,X2] :
( X0 = create_slb
| findmin_cpq_res(triple(X1,X0,X2)) = findmin_pqp_res(X1) ),
inference(cnf_transformation,[status(esa)],[f141]) ).
fof(f145,plain,
! [U,V,W] :
( ~ ok(findmin_cpq_eff(triple(U,V,W)))
| ( V != create_slb
& contains_slb(V,findmin_pqp_res(U))
& less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)) ) ),
inference(pre_NNF_transformation,[status(esa)],[f42]) ).
fof(f146,plain,
! [U,V] :
( ! [W] : ~ ok(findmin_cpq_eff(triple(U,V,W)))
| ( V != create_slb
& contains_slb(V,findmin_pqp_res(U))
& less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)) ) ),
inference(miniscoping,[status(esa)],[f145]) ).
fof(f148,plain,
! [X0,X1,X2] :
( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(cnf_transformation,[status(esa)],[f146]) ).
fof(f150,plain,
? [U,V,W] :
( ~ contains_cpq(triple(U,V,W),findmin_cpq_res(triple(U,V,W)))
& ok(findmin_cpq_eff(triple(U,V,W))) ),
inference(pre_NNF_transformation,[status(esa)],[f44]) ).
fof(f151,plain,
( ~ contains_cpq(triple(sk0_0,sk0_1,sk0_2),findmin_cpq_res(triple(sk0_0,sk0_1,sk0_2)))
& ok(findmin_cpq_eff(triple(sk0_0,sk0_1,sk0_2))) ),
inference(skolemization,[status(esa)],[f150]) ).
fof(f152,plain,
~ contains_cpq(triple(sk0_0,sk0_1,sk0_2),findmin_cpq_res(triple(sk0_0,sk0_1,sk0_2))),
inference(cnf_transformation,[status(esa)],[f151]) ).
fof(f153,plain,
ok(findmin_cpq_eff(triple(sk0_0,sk0_1,sk0_2))),
inference(cnf_transformation,[status(esa)],[f151]) ).
fof(f157,plain,
~ contains_slb(sk0_1,findmin_cpq_res(triple(sk0_0,sk0_1,sk0_2))),
inference(resolution,[status(thm)],[f111,f152]) ).
fof(f169,plain,
( spl0_3
<=> sk0_1 = create_slb ),
introduced(split_symbol_definition) ).
fof(f170,plain,
( sk0_1 = create_slb
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f169]) ).
fof(f175,plain,
( spl0_4
<=> contains_slb(sk0_1,findmin_pqp_res(sk0_0)) ),
introduced(split_symbol_definition) ).
fof(f177,plain,
( ~ contains_slb(sk0_1,findmin_pqp_res(sk0_0))
| spl0_4 ),
inference(component_clause,[status(thm)],[f175]) ).
fof(f178,plain,
( ~ contains_slb(sk0_1,findmin_pqp_res(sk0_0))
| sk0_1 = create_slb ),
inference(paramodulation,[status(thm)],[f142,f157]) ).
fof(f179,plain,
( ~ spl0_4
| spl0_3 ),
inference(split_clause,[status(thm)],[f178,f175,f169]) ).
fof(f180,plain,
contains_slb(sk0_1,findmin_pqp_res(sk0_0)),
inference(resolution,[status(thm)],[f148,f153]) ).
fof(f200,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f177,f180]) ).
fof(f201,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f200]) ).
fof(f202,plain,
( contains_slb(create_slb,findmin_pqp_res(sk0_0))
| ~ spl0_3 ),
inference(backward_demodulation,[status(thm)],[f170,f180]) ).
fof(f203,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f202,f58]) ).
fof(f204,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f203]) ).
fof(f205,plain,
$false,
inference(sat_refutation,[status(thm)],[f179,f201,f204]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV373+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n014.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Apr 30 00:39:19 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.6.0
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38 % Elapsed time: 0.024781 seconds
% 0.13/0.38 % CPU time: 0.033662 seconds
% 0.13/0.38 % Total memory used: 13.121 MB
% 0.13/0.38 % Net memory used: 13.072 MB
%------------------------------------------------------------------------------