TSTP Solution File: ALG439-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ALG439-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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:46 EDT 2024
% Result : Unsatisfiable 2.97s 1.17s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of clauses : 11 ( 4 unt; 3 nHn; 10 RR)
% Number of literals : 18 ( 17 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 2 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_781,plain,
c_Polynomial_Opoly(c_Polynomial_OpCons(X0,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_resolve__eq__raw_I2_J_0) ).
cnf(c_783,negated_conjecture,
( c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != v_y
| v_c != v_y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_784,negated_conjecture,
( c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) = v_y
| v_c = v_y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_1553,plain,
( v_c != v_y
| c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != v_y ),
inference(prop_impl_just,[status(thm)],[c_783]) ).
cnf(c_1554,plain,
( c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != v_y
| v_c != v_y ),
inference(renaming,[status(thm)],[c_1553]) ).
cnf(c_1555,plain,
( v_c = v_y
| c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) = v_y ),
inference(prop_impl_just,[status(thm)],[c_784]) ).
cnf(c_1556,plain,
( c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) = v_y
| v_c = v_y ),
inference(renaming,[status(thm)],[c_1555]) ).
cnf(c_9122,plain,
v_c = v_y,
inference(demodulation,[status(thm)],[c_1556,c_781]) ).
cnf(c_9677,plain,
( c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != v_c
| v_c != v_y ),
inference(light_normalisation,[status(thm)],[c_1554,c_9122]) ).
cnf(c_9678,plain,
v_c != v_c,
inference(demodulation,[status(thm)],[c_9677,c_781,c_9122]) ).
cnf(c_9679,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_9678]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ALG439-1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n012.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 : Thu May 2 22:36:40 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.97/1.17 % SZS status Started for theBenchmark.p
% 2.97/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.97/1.17
% 2.97/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.97/1.17
% 2.97/1.17 ------ iProver source info
% 2.97/1.17
% 2.97/1.17 git: date: 2024-05-02 19:28:25 +0000
% 2.97/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.97/1.17 git: non_committed_changes: false
% 2.97/1.17
% 2.97/1.17 ------ Parsing...successful
% 2.97/1.17
% 2.97/1.17
% 2.97/1.17
% 2.97/1.17 ------ Preprocessing...
% 2.97/1.17
% 2.97/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.97/1.17
% 2.97/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.97/1.17
% 2.97/1.17
%------------------------------------------------------------------------------