TSTP Solution File: ALG201+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ALG201+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:14 EDT 2024
% Result : Theorem 2.32s 1.19s
% Output : CNFRefutation 2.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 130 ( 43 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 152 ( 52 ~; 39 |; 31 &)
% ( 0 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 55 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( sorti1(X0)
=> op1(X0,X0) != X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
~ ! [X0] :
( sorti2(X0)
=> op2(X0,X0) != X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f5,conjecture,
( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f6,negated_conjecture,
~ ( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f7,plain,
~ ( ( ! [X0] :
( sorti2(X0)
=> sorti1(j(X0)) )
& ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> j(h(X2)) = X2 )
& ! [X3] :
( sorti2(X3)
=> h(j(X3)) = X3 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X6] :
( sorti1(X6)
=> ! [X7] :
( sorti1(X7)
=> h(op1(X6,X7)) = op2(h(X6),h(X7)) ) ) ) ),
inference(rectify,[],[f6]) ).
fof(f10,plain,
! [X0] :
( op1(X0,X0) != X0
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
? [X0] :
( op2(X0,X0) = X0
& sorti2(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f12,plain,
( ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X3] :
( h(j(X3)) = X3
| ~ sorti2(X3) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( ! [X7] :
( h(op1(X6,X7)) = op2(h(X6),h(X7))
| ~ sorti1(X7) )
| ~ sorti1(X6) )
& ! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) )
& ! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
( ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X3] :
( h(j(X3)) = X3
| ~ sorti2(X3) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( ! [X7] :
( h(op1(X6,X7)) = op2(h(X6),h(X7))
| ~ sorti1(X7) )
| ~ sorti1(X6) )
& ! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) )
& ! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) ) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
( ? [X0] :
( op2(X0,X0) = X0
& sorti2(X0) )
=> ( sK0 = op2(sK0,sK0)
& sorti2(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( sK0 = op2(sK0,sK0)
& sorti2(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f14]) ).
fof(f16,plain,
( ! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) )
& ! [X1] :
( h(j(X1)) = X1
| ~ sorti2(X1) )
& ! [X2] :
( ! [X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3) )
| ~ sorti2(X2) )
& ! [X4] :
( ! [X5] :
( h(op1(X4,X5)) = op2(h(X4),h(X5))
| ~ sorti1(X5) )
| ~ sorti1(X4) )
& ! [X6] :
( sorti1(j(X6))
| ~ sorti2(X6) )
& ! [X7] :
( sorti2(h(X7))
| ~ sorti1(X7) ) ),
inference(rectify,[],[f13]) ).
fof(f19,plain,
! [X0] :
( op1(X0,X0) != X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f20,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
sK0 = op2(sK0,sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f23,plain,
! [X6] :
( sorti1(j(X6))
| ~ sorti2(X6) ),
inference(cnf_transformation,[],[f16]) ).
fof(f25,plain,
! [X2,X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3)
| ~ sorti2(X2) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_51,plain,
( op1(X0,X0) != X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_52,plain,
op2(sK0,sK0) = sK0,
inference(cnf_transformation,[],[f21]) ).
cnf(c_53,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f20]) ).
cnf(c_56,negated_conjecture,
( ~ sorti2(X0)
| ~ sorti2(X1)
| op1(j(X0),j(X1)) = j(op2(X0,X1)) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_58,negated_conjecture,
( ~ sorti2(X0)
| sorti1(j(X0)) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_61,plain,
( ~ sorti2(sK0)
| sorti1(j(sK0)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_171,negated_conjecture,
( ~ sorti2(X0)
| ~ sorti2(X1)
| op1(j(X0),j(X1)) = j(op2(X0,X1)) ),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_438,plain,
( ~ sorti2(X0)
| op1(j(X0),j(sK0)) = j(op2(X0,sK0)) ),
inference(superposition,[status(thm)],[c_53,c_171]) ).
cnf(c_533,plain,
op1(j(sK0),j(sK0)) = j(op2(sK0,sK0)),
inference(superposition,[status(thm)],[c_53,c_438]) ).
cnf(c_535,plain,
op1(j(sK0),j(sK0)) = j(sK0),
inference(light_normalisation,[status(thm)],[c_533,c_52]) ).
cnf(c_578,plain,
( op1(j(X0),j(X0)) != j(X0)
| ~ sorti1(j(X0)) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_579,plain,
( op1(j(sK0),j(sK0)) != j(sK0)
| ~ sorti1(j(sK0)) ),
inference(instantiation,[status(thm)],[c_578]) ).
cnf(c_580,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_579,c_535,c_61,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG201+1 : TPTP v8.1.2. Released v2.7.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 23:07:03 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 2.32/1.19 % SZS status Started for theBenchmark.p
% 2.32/1.19 % SZS status Theorem for theBenchmark.p
% 2.32/1.19
% 2.32/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.32/1.19
% 2.32/1.19 ------ iProver source info
% 2.32/1.19
% 2.32/1.19 git: date: 2024-05-02 19:28:25 +0000
% 2.32/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.32/1.19 git: non_committed_changes: false
% 2.32/1.19
% 2.32/1.19 ------ Parsing...
% 2.32/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.32/1.19
% 2.32/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.32/1.19
% 2.32/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.32/1.19
% 2.32/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.32/1.19 ------ Proving...
% 2.32/1.19 ------ Problem Properties
% 2.32/1.19
% 2.32/1.19
% 2.32/1.19 clauses 11
% 2.32/1.19 conjectures 6
% 2.32/1.19 EPR 1
% 2.32/1.19 Horn 11
% 2.32/1.19 unary 2
% 2.32/1.19 binary 5
% 2.32/1.19 lits 24
% 2.32/1.19 lits eq 6
% 2.32/1.19 fd_pure 0
% 2.32/1.19 fd_pseudo 0
% 2.32/1.19 fd_cond 0
% 2.32/1.19 fd_pseudo_cond 0
% 2.32/1.19 AC symbols 0
% 2.32/1.19
% 2.32/1.19 ------ Schedule dynamic 5 is on
% 2.32/1.19
% 2.32/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.32/1.19
% 2.32/1.19
% 2.32/1.19 ------
% 2.32/1.19 Current options:
% 2.32/1.19 ------
% 2.32/1.19
% 2.32/1.19
% 2.32/1.19
% 2.32/1.19
% 2.32/1.19 ------ Proving...
% 2.32/1.19
% 2.32/1.19
% 2.32/1.19 % SZS status Theorem for theBenchmark.p
% 2.32/1.19
% 2.32/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.32/1.19
% 2.32/1.19
%------------------------------------------------------------------------------