TSTP Solution File: ALG417-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ALG417-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 : Fri May 3 02:04:44 EDT 2024
% Result : Unsatisfiable 7.79s 1.63s
% Output : CNFRefutation 7.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 9 ( 6 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 1 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_275,plain,
( ~ class_HOL_Ozero(X0)
| c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X0),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X0)),X0) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_pCons__0__0_0) ).
cnf(c_456,plain,
c_Polynomial_OpCons(v_k____,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex) = v_s____,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(c_457,plain,
c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)) != v_s____,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0_01) ).
cnf(c_458,negated_conjecture,
c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) = v_k____,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_552,plain,
class_HOL_Ozero(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__HOL_Ozero) ).
cnf(c_10894,plain,
c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(superposition,[status(thm)],[c_552,c_275]) ).
cnf(c_10896,plain,
c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)) = v_s____,
inference(demodulation,[status(thm)],[c_10894,c_456,c_458]) ).
cnf(c_10901,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10896,c_457]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG417-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 22:40:55 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.79/1.63 % SZS status Started for theBenchmark.p
% 7.79/1.63 % SZS status Unsatisfiable for theBenchmark.p
% 7.79/1.63
% 7.79/1.63 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.79/1.63
% 7.79/1.63 ------ iProver source info
% 7.79/1.63
% 7.79/1.63 git: date: 2024-05-02 19:28:25 +0000
% 7.79/1.63 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.79/1.63 git: non_committed_changes: false
% 7.79/1.63
% 7.79/1.63 ------ Parsing...successful
% 7.79/1.63
% 7.79/1.63
% 7.79/1.63
% 7.79/1.63 ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e
% 7.79/1.63
% 7.79/1.63 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 0 0s scvd_e snvd_s sp: 0 0s snvd_e
% 7.79/1.63
% 7.79/1.63 ------ Preprocessing...
% 7.79/1.63 ------ Proving...
% 7.79/1.63 ------ Problem Properties
% 7.79/1.63
% 7.79/1.63
% 7.79/1.63 clauses 554
% 7.79/1.63 conjectures 1
% 7.79/1.63 EPR 60
% 7.79/1.63 Horn 485
% 7.79/1.63 unary 241
% 7.79/1.63 binary 208
% 7.79/1.63 lits 1004
% 7.79/1.63 lits eq 588
% 7.79/1.63 fd_pure 0
% 7.79/1.63 fd_pseudo 0
% 7.79/1.63 fd_cond 58
% 7.79/1.63 fd_pseudo_cond 47
% 7.79/1.63 AC symbols 0
% 7.79/1.63
% 7.79/1.63 ------ Input Options Time Limit: Unbounded
% 7.79/1.63
% 7.79/1.63
% 7.79/1.63 ------
% 7.79/1.63 Current options:
% 7.79/1.63 ------
% 7.79/1.63
% 7.79/1.63
% 7.79/1.63
% 7.79/1.63
% 7.79/1.63 ------ Proving...
% 7.79/1.63
% 7.79/1.63
% 7.79/1.63 % SZS status Unsatisfiable for theBenchmark.p
% 7.79/1.63
% 7.79/1.63 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.79/1.63
% 7.79/1.63
%------------------------------------------------------------------------------