TSTP Solution File: KLE129+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE129+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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 : Thu Aug 31 05:32:12 EDT 2023
% Result : Theorem 3.24s 1.17s
% Output : CNFRefutation 3.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 18 unt; 0 def)
% Number of atoms : 51 ( 50 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 39 ( 18 ~; 10 |; 4 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn; 29 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_idempotence) ).
fof(f16,axiom,
! [X3] : antidomain(antidomain(X3)) = domain(X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain4) ).
fof(f23,axiom,
! [X3,X4] : forward_diamond(X3,X4) = domain(multiplication(X3,domain(X4))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',forward_diamond) ).
fof(f27,axiom,
! [X3] : divergence(X3) = forward_diamond(X3,divergence(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divergence1) ).
fof(f29,conjecture,
! [X3] :
( ! [X4] :
( forward_diamond(X3,domain(X4)) = addition(domain(X4),forward_diamond(X3,domain(X4)))
=> zero = domain(X4) )
=> zero = divergence(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f30,negated_conjecture,
~ ! [X3] :
( ! [X4] :
( forward_diamond(X3,domain(X4)) = addition(domain(X4),forward_diamond(X3,domain(X4)))
=> zero = domain(X4) )
=> zero = divergence(X3) ),
inference(negated_conjecture,[],[f29]) ).
fof(f35,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(rectify,[],[f16]) ).
fof(f42,plain,
! [X0,X1] : forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1))),
inference(rectify,[],[f23]) ).
fof(f46,plain,
! [X0] : divergence(X0) = forward_diamond(X0,divergence(X0)),
inference(rectify,[],[f27]) ).
fof(f48,plain,
~ ! [X0] :
( ! [X1] :
( forward_diamond(X0,domain(X1)) = addition(domain(X1),forward_diamond(X0,domain(X1)))
=> zero = domain(X1) )
=> zero = divergence(X0) ),
inference(rectify,[],[f30]) ).
fof(f50,plain,
? [X0] :
( zero != divergence(X0)
& ! [X1] :
( zero = domain(X1)
| forward_diamond(X0,domain(X1)) != addition(domain(X1),forward_diamond(X0,domain(X1))) ) ),
inference(ennf_transformation,[],[f48]) ).
fof(f51,plain,
( ? [X0] :
( zero != divergence(X0)
& ! [X1] :
( zero = domain(X1)
| forward_diamond(X0,domain(X1)) != addition(domain(X1),forward_diamond(X0,domain(X1))) ) )
=> ( zero != divergence(sK0)
& ! [X1] :
( zero = domain(X1)
| forward_diamond(sK0,domain(X1)) != addition(domain(X1),forward_diamond(sK0,domain(X1))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
( zero != divergence(sK0)
& ! [X1] :
( zero = domain(X1)
| forward_diamond(sK0,domain(X1)) != addition(domain(X1),forward_diamond(sK0,domain(X1))) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f50,f51]) ).
fof(f56,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f67,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(cnf_transformation,[],[f35]) ).
fof(f74,plain,
! [X0,X1] : forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[],[f42]) ).
fof(f78,plain,
! [X0] : divergence(X0) = forward_diamond(X0,divergence(X0)),
inference(cnf_transformation,[],[f46]) ).
fof(f80,plain,
! [X1] :
( zero = domain(X1)
| forward_diamond(sK0,domain(X1)) != addition(domain(X1),forward_diamond(sK0,domain(X1))) ),
inference(cnf_transformation,[],[f52]) ).
fof(f81,plain,
zero != divergence(sK0),
inference(cnf_transformation,[],[f52]) ).
fof(f86,plain,
! [X0,X1] : forward_diamond(X0,X1) = antidomain(antidomain(multiplication(X0,antidomain(antidomain(X1))))),
inference(definition_unfolding,[],[f74,f67,f67]) ).
fof(f88,plain,
! [X0] : divergence(X0) = antidomain(antidomain(multiplication(X0,antidomain(antidomain(divergence(X0)))))),
inference(definition_unfolding,[],[f78,f86]) ).
fof(f90,plain,
! [X1] :
( zero = antidomain(antidomain(X1))
| antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(X1))))))) != addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(X1)))))))) ),
inference(definition_unfolding,[],[f80,f67,f86,f67,f67,f86,f67]) ).
cnf(c_52,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f56]) ).
cnf(c_66,plain,
antidomain(antidomain(multiplication(X0,antidomain(antidomain(divergence(X0)))))) = divergence(X0),
inference(cnf_transformation,[],[f88]) ).
cnf(c_68,negated_conjecture,
divergence(sK0) != zero,
inference(cnf_transformation,[],[f81]) ).
cnf(c_69,negated_conjecture,
( addition(antidomain(antidomain(X0)),antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(X0)))))))) != antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(X0)))))))
| antidomain(antidomain(X0)) = zero ),
inference(cnf_transformation,[],[f90]) ).
cnf(c_408,plain,
( addition(divergence(X0),antidomain(antidomain(multiplication(sK0,antidomain(antidomain(divergence(X0))))))) != antidomain(antidomain(multiplication(sK0,antidomain(antidomain(divergence(X0))))))
| antidomain(antidomain(multiplication(X0,antidomain(antidomain(divergence(X0)))))) = zero ),
inference(superposition,[status(thm)],[c_66,c_69]) ).
cnf(c_411,plain,
( addition(divergence(X0),antidomain(antidomain(multiplication(sK0,antidomain(antidomain(divergence(X0))))))) != antidomain(antidomain(multiplication(sK0,antidomain(antidomain(divergence(X0))))))
| divergence(X0) = zero ),
inference(light_normalisation,[status(thm)],[c_408,c_66]) ).
cnf(c_596,plain,
( addition(divergence(sK0),divergence(sK0)) != divergence(sK0)
| divergence(sK0) = zero ),
inference(superposition,[status(thm)],[c_66,c_411]) ).
cnf(c_598,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_596,c_68,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE129+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n022.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 29 11:20:39 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.24/1.17 % SZS status Started for theBenchmark.p
% 3.24/1.17 % SZS status Theorem for theBenchmark.p
% 3.24/1.17
% 3.24/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.24/1.17
% 3.24/1.17 ------ iProver source info
% 3.24/1.17
% 3.24/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.24/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.24/1.17 git: non_committed_changes: false
% 3.24/1.17 git: last_make_outside_of_git: false
% 3.24/1.17
% 3.24/1.17 ------ Parsing...
% 3.24/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.24/1.17
% 3.24/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.24/1.17
% 3.24/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.24/1.17
% 3.24/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.24/1.17 ------ Proving...
% 3.24/1.17 ------ Problem Properties
% 3.24/1.17
% 3.24/1.17
% 3.24/1.17 clauses 21
% 3.24/1.17 conjectures 2
% 3.24/1.17 EPR 0
% 3.24/1.17 Horn 21
% 3.24/1.17 unary 19
% 3.24/1.17 binary 2
% 3.24/1.17 lits 23
% 3.24/1.17 lits eq 23
% 3.24/1.17 fd_pure 0
% 3.24/1.17 fd_pseudo 0
% 3.24/1.17 fd_cond 0
% 3.24/1.17 fd_pseudo_cond 0
% 3.24/1.17 AC symbols 1
% 3.24/1.17
% 3.24/1.17 ------ Schedule dynamic 5 is on
% 3.24/1.17
% 3.24/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.24/1.17
% 3.24/1.17
% 3.24/1.17 ------
% 3.24/1.17 Current options:
% 3.24/1.17 ------
% 3.24/1.17
% 3.24/1.17
% 3.24/1.17
% 3.24/1.17
% 3.24/1.17 ------ Proving...
% 3.24/1.17
% 3.24/1.17
% 3.24/1.17 % SZS status Theorem for theBenchmark.p
% 3.24/1.17
% 3.24/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.24/1.17
% 3.24/1.17
%------------------------------------------------------------------------------