%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ALG391-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 12:54:10 PM UTC 2026
% Result : Unsatisfiable 3.18s 1.18s
% Output : CNFRefutation 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 15 ( 14 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 3 ( 0 sgn 3 !; 0 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1407,negated_conjecture,
v_cs____ != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f1410,negated_conjecture,
! [X0] :
( X0 = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))
| c_Polynomial_Odegree(X0,t_a) != c_Polynomial_Odegree(v_cs____,t_a)
| c_Polynomial_Opoly(v_cs____,hAPP(v_x,X0),t_a) != c_Polynomial_Opoly(X0,hAPP(v_x,X0),t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f1411,plain,
! [X0] :
( c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) = X0
| c_Polynomial_Odegree(X0,t_a) != c_Polynomial_Odegree(v_cs____,t_a)
| c_Polynomial_Opoly(v_cs____,hAPP(v_x,X0),t_a) != c_Polynomial_Opoly(X0,hAPP(v_x,X0),t_a) ),
inference(reorient_equations,[],[f1410]) ).
tcf(c_2427,negated_conjecture,
c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) != v_cs____,
inference(cnf_transformation,[],[f1407]) ).
tcf(c_2429,negated_conjecture,
! [X0: $i] :
( ( c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) = X0 )
| ( c_Polynomial_Odegree(X0,t_a) != c_Polynomial_Odegree(v_cs____,t_a) )
| ( c_Polynomial_Opoly(X0,hAPP(v_x,X0),t_a) != c_Polynomial_Opoly(v_cs____,hAPP(v_x,X0),t_a) ) ),
inference(cnf_transformation,[],[f1411]) ).
tcf(c_2903,plain,
( ( c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) = v_cs____ )
| ( c_Polynomial_Odegree(v_cs____,t_a) != c_Polynomial_Odegree(v_cs____,t_a) ) ),
inference(equality_resolution,[status(thm)],[c_2429]) ).
tcf(c_2904,plain,
c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)) = v_cs____,
inference(equality_resolution_simp,[status(thm)],[c_2903]) ).
tcf(c_2905,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_2427,c_2904]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : ALG391-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.51 % Computer : n012.cluster.edu
% 0.03/0.51 % Model : x86_64 x86_64
% 0.03/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.51 % Memory : 8046.5625MB
% 0.03/0.51 % OS : Linux 6.8.0-71-generic
% 0.03/0.51 % CPULimit : 300
% 0.03/0.51 % WCLimit : 300
% 0.03/0.51 % DateTime : Fri Sep 25 05:32:15 UTC 2026
% 0.03/0.51 % CPUTime :
% 0.03/0.51 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.06/0.53 Running first-order theorem proving
% 0.06/0.53 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.54
% 0.06/0.54 % ======== iProver multi-core TPTP/SMT =========
% 0.06/0.54
% 0.06/0.54 % Detected problem language: tptp
% 0.06/0.55 % Proving...
% 3.18/1.18 % SZS status Started for theBenchmark.p
% 3.18/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.18/1.18
% 3.18/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.18/1.18
% 3.18/1.18 % ------ iProver source info
% 3.18/1.18
% 3.18/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.18/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.18/1.18 % git: non_committed_changes: false
% 3.18/1.18
% 3.18/1.18 % ------ Parsing...% successful
% 3.18/1.18
% 3.18/1.18
% 3.18/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.18/1.18 % ------ Proving...
% 3.18/1.18 % ------ Problem Properties
% 3.18/1.18
% 3.18/1.18 %
% 3.18/1.18 % clauses 1275
% 3.18/1.18 % conjectures 4
% 3.18/1.18 % EPR 191
% 3.18/1.18 % Horn 1105
% 3.18/1.18 % unary 154
% 3.18/1.18 % binary 505
% 3.18/1.18 % lits 3470
% 3.18/1.18 % lits eq 760
% 3.18/1.18 % fd_pure 0
% 3.18/1.18 % fd_pseudo 0
% 3.18/1.18 % fd_cond 20
% 3.18/1.18 % fd_pseudo_cond 152
% 3.18/1.18 % AC symbols 0
% 3.18/1.18
% 3.18/1.18 % ------ Input Options Time Limit: Unbounded
% 3.18/1.18
% 3.18/1.18
% 3.18/1.18 % ------
% 3.18/1.18 % Current options:
% 3.18/1.18 % ------
% 3.18/1.18
% 3.18/1.18
% 3.18/1.18 %
% 3.18/1.18
% 3.18/1.18 % ------ Proving...
% 3.18/1.18 %
% 3.18/1.18
% 3.18/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.18/1.18
% 3.18/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.18/1.18
% 3.18/1.18
%------------------------------------------------------------------------------