TSTP Solution File: ALG203+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ALG203+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:15 EDT 2024
% Result : Theorem 3.51s 1.17s
% Output : CNFRefutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 59 ( 18 unt; 0 def)
% Number of atoms : 203 ( 70 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 230 ( 86 ~; 67 |; 46 &)
% ( 0 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 62 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( sorti1(X0)
=> ! [X1] :
( sorti1(X1)
=> sorti1(op1(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(f3,axiom,
( ? [X1] :
( op1(X1,X1) != X1
& sorti1(X1) )
& ? [X0] :
( op1(X0,X0) = X0
& sorti1(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
~ ( ? [X1] :
( op2(X1,X1) != X1
& sorti2(X1) )
& ? [X0] :
( op2(X0,X0) = X0
& sorti2(X0) ) ),
file('/export/starexec/sandbox2/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/sandbox2/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] :
( op1(X0,X0) != X0
& sorti1(X0) )
& ? [X1] :
( op1(X1,X1) = X1
& sorti1(X1) ) ),
inference(rectify,[],[f3]) ).
fof(f8,plain,
~ ( ? [X0] :
( op2(X0,X0) != X0
& sorti2(X0) )
& ? [X1] :
( op2(X1,X1) = X1
& sorti2(X1) ) ),
inference(rectify,[],[f4]) ).
fof(f9,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] :
( ! [X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f12,plain,
( ! [X0] :
( op2(X0,X0) = X0
| ~ sorti2(X0) )
| ! [X1] :
( op2(X1,X1) != X1
| ~ sorti2(X1) ) ),
inference(ennf_transformation,[],[f8]) ).
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(ennf_transformation,[],[f9]) ).
fof(f14,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,[],[f13]) ).
fof(f15,plain,
( ? [X0] :
( op1(X0,X0) != X0
& sorti1(X0) )
=> ( sK0 != op1(sK0,sK0)
& sorti1(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X1] :
( op1(X1,X1) = X1
& sorti1(X1) )
=> ( sK1 = op1(sK1,sK1)
& sorti1(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( sK0 != op1(sK0,sK0)
& sorti1(sK0)
& sK1 = op1(sK1,sK1)
& sorti1(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f16,f15]) ).
fof(f18,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,[],[f14]) ).
fof(f19,plain,
! [X0,X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f21,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f22,plain,
sK1 = op1(sK1,sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f23,plain,
sorti1(sK0),
inference(cnf_transformation,[],[f17]) ).
fof(f24,plain,
sK0 != op1(sK0,sK0),
inference(cnf_transformation,[],[f17]) ).
fof(f25,plain,
! [X0,X1] :
( op2(X0,X0) = X0
| ~ sorti2(X0)
| op2(X1,X1) != X1
| ~ sorti2(X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f26,plain,
! [X7] :
( sorti2(h(X7))
| ~ sorti1(X7) ),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
! [X4,X5] :
( h(op1(X4,X5)) = op2(h(X4),h(X5))
| ~ sorti1(X5)
| ~ sorti1(X4) ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_49,plain,
( ~ sorti1(X0)
| ~ sorti1(X1)
| sorti1(op1(X0,X1)) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_51,plain,
op1(sK0,sK0) != sK0,
inference(cnf_transformation,[],[f24]) ).
cnf(c_52,plain,
sorti1(sK0),
inference(cnf_transformation,[],[f23]) ).
cnf(c_53,plain,
op1(sK1,sK1) = sK1,
inference(cnf_transformation,[],[f22]) ).
cnf(c_54,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f21]) ).
cnf(c_55,plain,
( op2(X0,X0) != X0
| ~ sorti2(X0)
| ~ sorti2(X1)
| op2(X1,X1) = X1 ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_56,negated_conjecture,
( ~ sorti1(X0)
| j(h(X0)) = X0 ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_59,negated_conjecture,
( ~ sorti1(X0)
| ~ sorti1(X1)
| op2(h(X0),h(X1)) = h(op1(X0,X1)) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_61,negated_conjecture,
( ~ sorti1(X0)
| sorti2(h(X0)) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_181,plain,
( ~ sorti2(X0)
| op2(X0,X0) = X0
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_55]) ).
cnf(c_182,plain,
( ~ sorti2(X0)
| op2(X0,X0) != X0
| ~ sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_55]) ).
cnf(c_183,plain,
( sP0_iProver_def
| sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_55]) ).
cnf(c_184,negated_conjecture,
( ~ sorti1(X0)
| sorti2(h(X0)) ),
inference(demodulation,[status(thm)],[c_61]) ).
cnf(c_186,negated_conjecture,
( ~ sorti1(X0)
| ~ sorti1(X1)
| op2(h(X0),h(X1)) = h(op1(X0,X1)) ),
inference(demodulation,[status(thm)],[c_59]) ).
cnf(c_189,negated_conjecture,
( ~ sorti1(X0)
| j(h(X0)) = X0 ),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_488,plain,
( ~ sorti1(X0)
| op2(h(X0),h(sK0)) = h(op1(X0,sK0)) ),
inference(superposition,[status(thm)],[c_52,c_186]) ).
cnf(c_491,plain,
j(h(sK0)) = sK0,
inference(superposition,[status(thm)],[c_52,c_189]) ).
cnf(c_497,plain,
( ~ sorti1(X0)
| op2(h(X0),h(sK1)) = h(op1(X0,sK1)) ),
inference(superposition,[status(thm)],[c_54,c_186]) ).
cnf(c_538,plain,
op2(h(sK0),h(sK0)) = h(op1(sK0,sK0)),
inference(superposition,[status(thm)],[c_52,c_488]) ).
cnf(c_549,plain,
op2(h(sK1),h(sK1)) = h(op1(sK1,sK1)),
inference(superposition,[status(thm)],[c_54,c_497]) ).
cnf(c_551,plain,
op2(h(sK1),h(sK1)) = h(sK1),
inference(light_normalisation,[status(thm)],[c_549,c_53]) ).
cnf(c_609,plain,
( ~ sorti1(X0)
| ~ sorti1(X1)
| j(h(op1(X0,X1))) = op1(X0,X1) ),
inference(superposition,[status(thm)],[c_49,c_189]) ).
cnf(c_715,plain,
( ~ sorti1(X0)
| ~ sP0_iProver_def
| op2(h(X0),h(X0)) = h(X0) ),
inference(superposition,[status(thm)],[c_184,c_181]) ).
cnf(c_809,plain,
( ~ sP0_iProver_def
| op2(h(sK0),h(sK0)) = h(sK0) ),
inference(superposition,[status(thm)],[c_52,c_715]) ).
cnf(c_812,plain,
( ~ sP0_iProver_def
| h(op1(sK0,sK0)) = h(sK0) ),
inference(light_normalisation,[status(thm)],[c_809,c_538]) ).
cnf(c_830,plain,
( ~ sorti1(X0)
| j(h(op1(X0,sK0))) = op1(X0,sK0) ),
inference(superposition,[status(thm)],[c_52,c_609]) ).
cnf(c_1025,plain,
( ~ sorti2(h(sK1))
| ~ sP1_iProver_def ),
inference(superposition,[status(thm)],[c_551,c_182]) ).
cnf(c_1194,plain,
( ~ sorti1(sK1)
| ~ sP1_iProver_def ),
inference(superposition,[status(thm)],[c_184,c_1025]) ).
cnf(c_1195,plain,
~ sP1_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_1194,c_54]) ).
cnf(c_1196,plain,
sP0_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_183,c_1195]) ).
cnf(c_1197,plain,
h(op1(sK0,sK0)) = h(sK0),
inference(backward_subsumption_resolution,[status(thm)],[c_812,c_1196]) ).
cnf(c_1708,plain,
j(h(op1(sK0,sK0))) = op1(sK0,sK0),
inference(superposition,[status(thm)],[c_52,c_830]) ).
cnf(c_1711,plain,
op1(sK0,sK0) = sK0,
inference(light_normalisation,[status(thm)],[c_1708,c_491,c_1197]) ).
cnf(c_1712,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1711,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : ALG203+1 : TPTP v8.1.2. Released v2.7.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 23:06:43 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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
% 3.51/1.17 % SZS status Started for theBenchmark.p
% 3.51/1.17 % SZS status Theorem for theBenchmark.p
% 3.51/1.17
% 3.51/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.51/1.17
% 3.51/1.17 ------ iProver source info
% 3.51/1.17
% 3.51/1.17 git: date: 2024-05-02 19:28:25 +0000
% 3.51/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.51/1.17 git: non_committed_changes: false
% 3.51/1.17
% 3.51/1.17 ------ Parsing...
% 3.51/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.51/1.17
% 3.51/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.51/1.17
% 3.51/1.17 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.51/1.17
% 3.51/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.51/1.17 ------ Proving...
% 3.51/1.17 ------ Problem Properties
% 3.51/1.17
% 3.51/1.17
% 3.51/1.17 clauses 15
% 3.51/1.17 conjectures 6
% 3.51/1.17 EPR 3
% 3.51/1.17 Horn 14
% 3.51/1.17 unary 4
% 3.51/1.17 binary 5
% 3.51/1.17 lits 32
% 3.51/1.17 lits eq 8
% 3.51/1.17 fd_pure 0
% 3.51/1.17 fd_pseudo 0
% 3.51/1.17 fd_cond 0
% 3.51/1.17 fd_pseudo_cond 0
% 3.51/1.17 AC symbols 0
% 3.51/1.17
% 3.51/1.17 ------ Schedule dynamic 5 is on
% 3.51/1.17
% 3.51/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.51/1.17
% 3.51/1.17
% 3.51/1.17 ------
% 3.51/1.17 Current options:
% 3.51/1.17 ------
% 3.51/1.17
% 3.51/1.17
% 3.51/1.17
% 3.51/1.17
% 3.51/1.17 ------ Proving...
% 3.51/1.17
% 3.51/1.17
% 3.51/1.17 % SZS status Theorem for theBenchmark.p
% 3.51/1.17
% 3.51/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.51/1.17
% 3.51/1.17
%------------------------------------------------------------------------------