TSTP Solution File: KLE072+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE072+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:00 EDT 2023
% Result : Theorem 1.22s 1.17s
% Output : CNFRefutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 23 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 9 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn; 34 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f2,axiom,
! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).
fof(f17,axiom,
! [X3,X4] : domain(addition(X3,X4)) = addition(domain(X3),domain(X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain5) ).
fof(f18,conjecture,
! [X3,X4,X5] : domain(multiplication(addition(X3,X4),domain(X5))) = addition(domain(multiplication(X3,domain(X5))),domain(multiplication(X4,domain(X5)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X3,X4,X5] : domain(multiplication(addition(X3,X4),domain(X5))) = addition(domain(multiplication(X3,domain(X5))),domain(multiplication(X4,domain(X5)))),
inference(negated_conjecture,[],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f24,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(rectify,[],[f17]) ).
fof(f25,plain,
~ ! [X0,X1,X2] : domain(multiplication(addition(X0,X1),domain(X2))) = addition(domain(multiplication(X0,domain(X2))),domain(multiplication(X1,domain(X2)))),
inference(rectify,[],[f19]) ).
fof(f26,plain,
? [X0,X1,X2] : domain(multiplication(addition(X0,X1),domain(X2))) != addition(domain(multiplication(X0,domain(X2))),domain(multiplication(X1,domain(X2)))),
inference(ennf_transformation,[],[f25]) ).
fof(f27,plain,
( ? [X0,X1,X2] : domain(multiplication(addition(X0,X1),domain(X2))) != addition(domain(multiplication(X0,domain(X2))),domain(multiplication(X1,domain(X2))))
=> domain(multiplication(addition(sK0,sK1),domain(sK2))) != addition(domain(multiplication(sK0,domain(sK2))),domain(multiplication(sK1,domain(sK2)))) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
domain(multiplication(addition(sK0,sK1),domain(sK2))) != addition(domain(multiplication(sK0,domain(sK2))),domain(multiplication(sK1,domain(sK2)))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f26,f27]) ).
fof(f29,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f30,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f20]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f44,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
domain(multiplication(addition(sK0,sK1),domain(sK2))) != addition(domain(multiplication(sK0,domain(sK2))),domain(multiplication(sK1,domain(sK2)))),
inference(cnf_transformation,[],[f28]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f29]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f30]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f37]) ).
cnf(c_64,plain,
addition(domain(X0),domain(X1)) = domain(addition(X0,X1)),
inference(cnf_transformation,[],[f44]) ).
cnf(c_65,negated_conjecture,
addition(domain(multiplication(sK0,domain(sK2))),domain(multiplication(sK1,domain(sK2)))) != domain(multiplication(addition(sK0,sK1),domain(sK2))),
inference(cnf_transformation,[],[f45]) ).
cnf(c_115,plain,
domain(addition(multiplication(sK0,domain(sK2)),multiplication(sK1,domain(sK2)))) != domain(multiplication(addition(sK0,sK1),domain(sK2))),
inference(ac_demodulation,[status(thm)],[c_65,c_64,c_50,c_49]) ).
cnf(c_116,plain,
$false,
inference(ac_demodulation,[status(thm)],[c_115,c_57,c_50,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE072+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n027.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 : Tue Aug 29 11:40:53 EDT 2023
% 0.14/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
% 1.22/1.17 % SZS status Started for theBenchmark.p
% 1.22/1.17 % SZS status Theorem for theBenchmark.p
% 1.22/1.17
% 1.22/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.22/1.17
% 1.22/1.17 ------ iProver source info
% 1.22/1.17
% 1.22/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.22/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.22/1.17 git: non_committed_changes: false
% 1.22/1.17 git: last_make_outside_of_git: false
% 1.22/1.17
% 1.22/1.17 ------ Parsing...
% 1.22/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.22/1.17
% 1.22/1.17 ------ Preprocessing...
% 1.22/1.17
% 1.22/1.17 % SZS status Theorem for theBenchmark.p
% 1.22/1.17
% 1.22/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.22/1.17
% 1.22/1.17
%------------------------------------------------------------------------------