TSTP Solution File: KLE074+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE074+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 2.29s 1.13s
% Output : CNFRefutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 19 unt; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn; 21 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f14,axiom,
! [X3,X4] : domain(multiplication(X3,X4)) = domain(multiplication(X3,domain(X4))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain2) ).
fof(f18,conjecture,
! [X3,X4,X5] : domain(multiplication(multiplication(X3,X4),domain(X5))) = domain(multiplication(X3,domain(multiplication(X4,domain(X5))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X3,X4,X5] : domain(multiplication(multiplication(X3,X4),domain(X5))) = domain(multiplication(X3,domain(multiplication(X4,domain(X5))))),
inference(negated_conjecture,[],[f18]) ).
fof(f22,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(rectify,[],[f14]) ).
fof(f25,plain,
~ ! [X0,X1,X2] : domain(multiplication(multiplication(X0,X1),domain(X2))) = domain(multiplication(X0,domain(multiplication(X1,domain(X2))))),
inference(rectify,[],[f19]) ).
fof(f26,plain,
? [X0,X1,X2] : domain(multiplication(multiplication(X0,X1),domain(X2))) != domain(multiplication(X0,domain(multiplication(X1,domain(X2))))),
inference(ennf_transformation,[],[f25]) ).
fof(f27,plain,
( ? [X0,X1,X2] : domain(multiplication(multiplication(X0,X1),domain(X2))) != domain(multiplication(X0,domain(multiplication(X1,domain(X2)))))
=> domain(multiplication(multiplication(sK0,sK1),domain(sK2))) != domain(multiplication(sK0,domain(multiplication(sK1,domain(sK2))))) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
domain(multiplication(multiplication(sK0,sK1),domain(sK2))) != domain(multiplication(sK0,domain(multiplication(sK1,domain(sK2))))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f26,f27]) ).
fof(f33,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f41,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[],[f22]) ).
fof(f45,plain,
domain(multiplication(multiplication(sK0,sK1),domain(sK2))) != domain(multiplication(sK0,domain(multiplication(sK1,domain(sK2))))),
inference(cnf_transformation,[],[f28]) ).
cnf(c_53,plain,
multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f33]) ).
cnf(c_61,plain,
domain(multiplication(X0,domain(X1))) = domain(multiplication(X0,X1)),
inference(cnf_transformation,[],[f41]) ).
cnf(c_65,negated_conjecture,
domain(multiplication(sK0,domain(multiplication(sK1,domain(sK2))))) != domain(multiplication(multiplication(sK0,sK1),domain(sK2))),
inference(cnf_transformation,[],[f45]) ).
cnf(c_115,plain,
domain(multiplication(sK0,multiplication(sK1,domain(sK2)))) != domain(multiplication(sK0,multiplication(sK1,sK2))),
inference(demodulation,[status(thm)],[c_65,c_53,c_61]) ).
cnf(c_198,plain,
domain(multiplication(X0,multiplication(X1,domain(X2)))) = domain(multiplication(X0,domain(multiplication(X1,X2)))),
inference(superposition,[status(thm)],[c_61,c_61]) ).
cnf(c_294,plain,
domain(multiplication(X0,multiplication(X1,domain(X2)))) = domain(multiplication(X0,multiplication(X1,X2))),
inference(demodulation,[status(thm)],[c_198,c_61]) ).
cnf(c_295,plain,
domain(multiplication(sK0,multiplication(sK1,sK2))) != domain(multiplication(sK0,multiplication(sK1,sK2))),
inference(demodulation,[status(thm)],[c_115,c_294]) ).
cnf(c_296,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_295]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE074+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 29 10:49:58 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.29/1.13 % SZS status Started for theBenchmark.p
% 2.29/1.13 % SZS status Theorem for theBenchmark.p
% 2.29/1.13
% 2.29/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.29/1.13
% 2.29/1.13 ------ iProver source info
% 2.29/1.13
% 2.29/1.13 git: date: 2023-05-31 18:12:56 +0000
% 2.29/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.29/1.13 git: non_committed_changes: false
% 2.29/1.13 git: last_make_outside_of_git: false
% 2.29/1.13
% 2.29/1.13 ------ Parsing...
% 2.29/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.29/1.13
% 2.29/1.13 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.29/1.13
% 2.29/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.29/1.13
% 2.29/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.29/1.13 ------ Proving...
% 2.29/1.13 ------ Problem Properties
% 2.29/1.13
% 2.29/1.13
% 2.29/1.13 clauses 17
% 2.29/1.13 conjectures 0
% 2.29/1.13 EPR 0
% 2.29/1.13 Horn 17
% 2.29/1.13 unary 17
% 2.29/1.13 binary 0
% 2.29/1.13 lits 17
% 2.29/1.13 lits eq 17
% 2.29/1.13 fd_pure 0
% 2.29/1.13 fd_pseudo 0
% 2.29/1.13 fd_cond 0
% 2.29/1.13 fd_pseudo_cond 0
% 2.29/1.13 AC symbols 1
% 2.29/1.13
% 2.29/1.13 ------ Schedule UEQ
% 2.29/1.13
% 2.29/1.13 ------ Option_UEQ Time Limit: 10.
% 2.29/1.13
% 2.29/1.13
% 2.29/1.13 ------
% 2.29/1.13 Current options:
% 2.29/1.13 ------
% 2.29/1.13
% 2.29/1.13
% 2.29/1.13
% 2.29/1.13
% 2.29/1.13 ------ Proving...
% 2.29/1.13
% 2.29/1.13
% 2.29/1.13 % SZS status Theorem for theBenchmark.p
% 2.29/1.13
% 2.29/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.29/1.13
% 2.29/1.13
%------------------------------------------------------------------------------