TSTP Solution File: SYN417+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN417+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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 Sep 1 03:06:59 EDT 2023
% Result : Theorem 2.51s 1.16s
% Output : CNFRefutation 2.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 52
% Number of leaves : 5
% Syntax : Number of formulae : 131 ( 16 unt; 0 def)
% Number of atoms : 367 ( 306 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 363 ( 127 ~; 191 |; 31 &)
% ( 3 <=>; 10 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 77 ( 0 sgn; 38 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X0] :
( ! [X1] :
( f(g(X1)) = X1
=> X0 = X1 )
& f(g(X0)) = X0 )
<=> ? [X0] :
( ! [X1] :
( g(f(X1)) = X1
=> X0 = X1 )
& g(f(X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cute) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( ! [X1] :
( f(g(X1)) = X1
=> X0 = X1 )
& f(g(X0)) = X0 )
<=> ? [X0] :
( ! [X1] :
( g(f(X1)) = X1
=> X0 = X1 )
& g(f(X0)) = X0 ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ? [X0] :
( ! [X1] :
( f(g(X1)) = X1
=> X0 = X1 )
& f(g(X0)) = X0 )
<=> ? [X2] :
( ! [X3] :
( g(f(X3)) = X3
=> X2 = X3 )
& g(f(X2)) = X2 ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X0] :
( ! [X1] :
( X0 = X1
| f(g(X1)) != X1 )
& f(g(X0)) = X0 )
<~> ? [X2] :
( ! [X3] :
( X2 = X3
| g(f(X3)) != X3 )
& g(f(X2)) = X2 ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ! [X2] :
( ? [X3] :
( X2 != X3
& g(f(X3)) = X3 )
| g(f(X2)) != X2 )
| ! [X0] :
( ? [X1] :
( X0 != X1
& f(g(X1)) = X1 )
| f(g(X0)) != X0 ) )
& ( ? [X2] :
( ! [X3] :
( X2 = X3
| g(f(X3)) != X3 )
& g(f(X2)) = X2 )
| ? [X0] :
( ! [X1] :
( X0 = X1
| f(g(X1)) != X1 )
& f(g(X0)) = X0 ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ! [X0] :
( ? [X1] :
( X0 != X1
& g(f(X1)) = X1 )
| g(f(X0)) != X0 )
| ! [X2] :
( ? [X3] :
( X2 != X3
& f(g(X3)) = X3 )
| f(g(X2)) != X2 ) )
& ( ? [X4] :
( ! [X5] :
( X4 = X5
| g(f(X5)) != X5 )
& g(f(X4)) = X4 )
| ? [X6] :
( ! [X7] :
( X6 = X7
| f(g(X7)) != X7 )
& f(g(X6)) = X6 ) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
! [X0] :
( ? [X1] :
( X0 != X1
& g(f(X1)) = X1 )
=> ( sK0(X0) != X0
& sK0(X0) = g(f(sK0(X0))) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2] :
( ? [X3] :
( X2 != X3
& f(g(X3)) = X3 )
=> ( sK1(X2) != X2
& sK1(X2) = f(g(sK1(X2))) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] :
( ! [X5] :
( X4 = X5
| g(f(X5)) != X5 )
& g(f(X4)) = X4 )
=> ( ! [X5] :
( sK2 = X5
| g(f(X5)) != X5 )
& sK2 = g(f(sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X6] :
( ! [X7] :
( X6 = X7
| f(g(X7)) != X7 )
& f(g(X6)) = X6 )
=> ( ! [X7] :
( sK3 = X7
| f(g(X7)) != X7 )
& sK3 = f(g(sK3)) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ( ! [X0] :
( ( sK0(X0) != X0
& sK0(X0) = g(f(sK0(X0))) )
| g(f(X0)) != X0 )
| ! [X2] :
( ( sK1(X2) != X2
& sK1(X2) = f(g(sK1(X2))) )
| f(g(X2)) != X2 ) )
& ( ( ! [X5] :
( sK2 = X5
| g(f(X5)) != X5 )
& sK2 = g(f(sK2)) )
| ( ! [X7] :
( sK3 = X7
| f(g(X7)) != X7 )
& sK3 = f(g(sK3)) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f6,f10,f9,f8,f7]) ).
fof(f12,plain,
( sK2 = g(f(sK2))
| sK3 = f(g(sK3)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f13,plain,
! [X7] :
( sK2 = g(f(sK2))
| sK3 = X7
| f(g(X7)) != X7 ),
inference(cnf_transformation,[],[f11]) ).
fof(f14,plain,
! [X5] :
( sK2 = X5
| g(f(X5)) != X5
| sK3 = f(g(sK3)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f15,plain,
! [X7,X5] :
( sK2 = X5
| g(f(X5)) != X5
| sK3 = X7
| f(g(X7)) != X7 ),
inference(cnf_transformation,[],[f11]) ).
fof(f16,plain,
! [X2,X0] :
( sK0(X0) = g(f(sK0(X0)))
| g(f(X0)) != X0
| sK1(X2) = f(g(sK1(X2)))
| f(g(X2)) != X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f17,plain,
! [X2,X0] :
( sK0(X0) = g(f(sK0(X0)))
| g(f(X0)) != X0
| sK1(X2) != X2
| f(g(X2)) != X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f18,plain,
! [X2,X0] :
( sK0(X0) != X0
| g(f(X0)) != X0
| sK1(X2) = f(g(sK1(X2)))
| f(g(X2)) != X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f19,plain,
! [X2,X0] :
( sK0(X0) != X0
| g(f(X0)) != X0
| sK1(X2) != X2
| f(g(X2)) != X2 ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_49,negated_conjecture,
( f(g(X0)) != X0
| g(f(X1)) != X1
| sK0(X1) != X1
| sK1(X0) != X0 ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_50,negated_conjecture,
( f(g(X0)) != X0
| g(f(X1)) != X1
| sK0(X1) != X1
| f(g(sK1(X0))) = sK1(X0) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_51,negated_conjecture,
( f(g(X0)) != X0
| g(f(X1)) != X1
| sK1(X0) != X0
| g(f(sK0(X1))) = sK0(X1) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_52,negated_conjecture,
( f(g(X0)) != X0
| g(f(X1)) != X1
| f(g(sK1(X0))) = sK1(X0)
| g(f(sK0(X1))) = sK0(X1) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_53,negated_conjecture,
( f(g(X0)) != X0
| g(f(X1)) != X1
| X0 = sK3
| X1 = sK2 ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_54,negated_conjecture,
( g(f(X0)) != X0
| f(g(sK3)) = sK3
| X0 = sK2 ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_55,negated_conjecture,
( f(g(X0)) != X0
| g(f(sK2)) = sK2
| X0 = sK3 ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_56,negated_conjecture,
( f(g(sK3)) = sK3
| g(f(sK2)) = sK2 ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_178,negated_conjecture,
( X0 = sK2
| g(f(X0)) != X0
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_53]) ).
cnf(c_179,negated_conjecture,
( X0 = sK3
| f(g(X0)) != X0
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_53]) ).
cnf(c_180,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_53]) ).
cnf(c_181,negated_conjecture,
( g(f(X0)) != X0
| g(f(sK0(X0))) = sK0(X0)
| ~ sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_52]) ).
cnf(c_182,negated_conjecture,
( f(g(X0)) != X0
| f(g(sK1(X0))) = sK1(X0)
| ~ sP3_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP3_iProver_split])],[c_52]) ).
cnf(c_183,negated_conjecture,
( sP2_iProver_split
| sP3_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_52]) ).
cnf(c_184,negated_conjecture,
( sK1(X0) != X0
| f(g(X0)) != X0
| ~ sP4_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP4_iProver_split])],[c_51]) ).
cnf(c_185,negated_conjecture,
( sP2_iProver_split
| sP4_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_51]) ).
cnf(c_186,negated_conjecture,
( g(f(X0)) != X0
| sK0(X0) != X0
| ~ sP5_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP5_iProver_split])],[c_50]) ).
cnf(c_187,negated_conjecture,
( sP3_iProver_split
| sP5_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_50]) ).
cnf(c_188,negated_conjecture,
( sP4_iProver_split
| sP5_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_49]) ).
cnf(c_197,plain,
( g(f(sK2)) != sK2
| ~ sP2_iProver_split
| g(f(sK0(sK2))) = sK0(sK2) ),
inference(instantiation,[status(thm)],[c_181]) ).
cnf(c_200,plain,
( g(f(sK2)) != sK2
| sK0(sK2) != sK2
| ~ sP5_iProver_split ),
inference(instantiation,[status(thm)],[c_186]) ).
cnf(c_358,plain,
( sK1(f(sK2)) != f(sK2)
| ~ sP4_iProver_split
| f(g(sK3)) = sK3 ),
inference(superposition,[status(thm)],[c_56,c_184]) ).
cnf(c_368,plain,
( sK0(sK2) != sK2
| ~ sP5_iProver_split
| f(g(sK3)) = sK3 ),
inference(superposition,[status(thm)],[c_56,c_186]) ).
cnf(c_396,plain,
( ~ sP2_iProver_split
| g(f(sK0(sK2))) = sK0(sK2)
| f(g(sK3)) = sK3 ),
inference(superposition,[status(thm)],[c_56,c_181]) ).
cnf(c_406,plain,
( ~ sP3_iProver_split
| f(g(sK1(f(sK2)))) = sK1(f(sK2))
| f(g(sK3)) = sK3 ),
inference(superposition,[status(thm)],[c_56,c_182]) ).
cnf(c_422,plain,
( f(g(sK1(f(sK2)))) = sK1(f(sK2))
| f(g(sK3)) = sK3
| sP2_iProver_split ),
inference(superposition,[status(thm)],[c_183,c_406]) ).
cnf(c_432,plain,
( f(g(sK1(f(sK2)))) = sK1(f(sK2))
| g(f(sK0(sK2))) = sK0(sK2)
| f(g(sK3)) = sK3 ),
inference(superposition,[status(thm)],[c_422,c_396]) ).
cnf(c_444,plain,
( g(f(sK0(sK2))) = sK0(sK2)
| g(sK1(f(sK2))) = sK2
| f(g(sK3)) = sK3 ),
inference(superposition,[status(thm)],[c_432,c_54]) ).
cnf(c_449,plain,
( ~ sP1_iProver_split
| g(f(sK0(sK2))) = sK0(sK2)
| f(g(sK3)) = sK3
| sK1(f(sK2)) = sK3 ),
inference(superposition,[status(thm)],[c_432,c_179]) ).
cnf(c_483,plain,
( g(f(sK0(sK2))) = sK0(sK2)
| f(g(sK3)) = sK3
| sK1(f(sK2)) = f(sK2) ),
inference(superposition,[status(thm)],[c_444,c_432]) ).
cnf(c_492,plain,
( f(g(sK3)) = sK3
| g(f(sK0(sK2))) = sK0(sK2) ),
inference(global_subsumption_just,[status(thm)],[c_449,c_56,c_197,c_185,c_358,c_483]) ).
cnf(c_493,plain,
( g(f(sK0(sK2))) = sK0(sK2)
| f(g(sK3)) = sK3 ),
inference(renaming,[status(thm)],[c_492]) ).
cnf(c_500,plain,
( f(g(sK3)) = sK3
| sK0(sK2) = sK2 ),
inference(superposition,[status(thm)],[c_493,c_54]) ).
cnf(c_502,plain,
( ~ sP3_iProver_split
| f(g(sK1(f(sK0(sK2))))) = sK1(f(sK0(sK2)))
| f(g(sK3)) = sK3 ),
inference(superposition,[status(thm)],[c_493,c_182]) ).
cnf(c_530,plain,
( ~ sP5_iProver_split
| f(g(sK3)) = sK3 ),
inference(backward_subsumption_resolution,[status(thm)],[c_368,c_500]) ).
cnf(c_565,plain,
( f(g(sK3)) = sK3
| sP4_iProver_split ),
inference(superposition,[status(thm)],[c_188,c_530]) ).
cnf(c_566,plain,
( f(g(sK3)) = sK3
| sP3_iProver_split ),
inference(superposition,[status(thm)],[c_187,c_530]) ).
cnf(c_581,plain,
( sK1(f(sK2)) != f(sK2)
| f(g(sK3)) = sK3 ),
inference(backward_subsumption_resolution,[status(thm)],[c_358,c_565]) ).
cnf(c_588,plain,
( f(g(sK1(f(sK2)))) = sK1(f(sK2))
| f(g(sK3)) = sK3 ),
inference(backward_subsumption_resolution,[status(thm)],[c_406,c_566]) ).
cnf(c_673,plain,
( f(g(sK1(f(sK0(sK2))))) = sK1(f(sK0(sK2)))
| f(g(sK3)) = sK3 ),
inference(global_subsumption_just,[status(thm)],[c_502,c_502,c_566]) ).
cnf(c_681,plain,
( g(sK1(f(sK0(sK2)))) = sK2
| f(g(sK3)) = sK3 ),
inference(superposition,[status(thm)],[c_673,c_54]) ).
cnf(c_720,plain,
( g(sK1(f(sK2))) = sK2
| f(g(sK3)) = sK3 ),
inference(superposition,[status(thm)],[c_588,c_54]) ).
cnf(c_748,plain,
( f(g(sK3)) = sK3
| sK1(f(sK2)) = f(sK2) ),
inference(superposition,[status(thm)],[c_720,c_588]) ).
cnf(c_757,plain,
f(g(sK3)) = sK3,
inference(global_subsumption_just,[status(thm)],[c_681,c_581,c_748]) ).
cnf(c_771,plain,
( ~ sP2_iProver_split
| g(f(sK0(g(sK3)))) = sK0(g(sK3)) ),
inference(superposition,[status(thm)],[c_757,c_181]) ).
cnf(c_772,plain,
( sK0(g(sK3)) != g(sK3)
| ~ sP5_iProver_split ),
inference(superposition,[status(thm)],[c_757,c_186]) ).
cnf(c_773,plain,
( ~ sP0_iProver_split
| g(sK3) = sK2 ),
inference(superposition,[status(thm)],[c_757,c_178]) ).
cnf(c_774,plain,
( ~ sP3_iProver_split
| f(g(sK1(sK3))) = sK1(sK3) ),
inference(superposition,[status(thm)],[c_757,c_182]) ).
cnf(c_775,plain,
( sK1(sK3) != sK3
| ~ sP4_iProver_split ),
inference(superposition,[status(thm)],[c_757,c_184]) ).
cnf(c_804,plain,
( f(g(sK1(sK3))) = sK1(sK3)
| sP2_iProver_split ),
inference(superposition,[status(thm)],[c_183,c_774]) ).
cnf(c_815,plain,
( g(f(sK0(g(sK3)))) = sK0(g(sK3))
| f(g(sK1(sK3))) = sK1(sK3) ),
inference(superposition,[status(thm)],[c_804,c_771]) ).
cnf(c_844,plain,
( ~ sP2_iProver_split
| g(f(sK0(sK0(g(sK3))))) = sK0(sK0(g(sK3)))
| f(g(sK1(sK3))) = sK1(sK3) ),
inference(superposition,[status(thm)],[c_815,c_181]) ).
cnf(c_847,plain,
( ~ sP3_iProver_split
| f(g(sK1(f(sK0(g(sK3)))))) = sK1(f(sK0(g(sK3))))
| f(g(sK1(sK3))) = sK1(sK3) ),
inference(superposition,[status(thm)],[c_815,c_182]) ).
cnf(c_849,plain,
( f(sK0(g(sK3))) = sK3
| f(g(sK1(sK3))) = sK1(sK3)
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_815,c_55]) ).
cnf(c_850,plain,
( ~ sP1_iProver_split
| f(sK0(g(sK3))) = sK3
| f(g(sK1(sK3))) = sK1(sK3) ),
inference(superposition,[status(thm)],[c_815,c_179]) ).
cnf(c_884,plain,
( f(sK0(g(sK3))) = sK3
| f(g(sK1(sK3))) = sK1(sK3)
| sP0_iProver_split ),
inference(superposition,[status(thm)],[c_180,c_850]) ).
cnf(c_895,plain,
( f(sK0(g(sK3))) = sK3
| f(g(sK1(sK3))) = sK1(sK3)
| g(sK3) = sK2 ),
inference(superposition,[status(thm)],[c_884,c_773]) ).
cnf(c_917,plain,
( f(g(sK1(sK3))) = sK1(sK3)
| sK0(g(sK3)) = g(sK3)
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_849,c_815]) ).
cnf(c_921,plain,
( g(f(sK0(sK0(g(sK3))))) = sK0(sK0(g(sK3)))
| f(g(sK1(sK3))) = sK1(sK3) ),
inference(global_subsumption_just,[status(thm)],[c_844,c_804,c_844]) ).
cnf(c_932,plain,
( f(sK0(sK0(g(sK3)))) = sK3
| f(g(sK1(sK3))) = sK1(sK3)
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_921,c_55]) ).
cnf(c_1116,plain,
( f(g(sK1(sK3))) = sK1(sK3)
| g(f(sK2)) = sK2 ),
inference(global_subsumption_just,[status(thm)],[c_932,c_187,c_774,c_772,c_917]) ).
cnf(c_1122,plain,
( ~ sP2_iProver_split
| g(f(sK0(g(sK1(sK3))))) = sK0(g(sK1(sK3)))
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_1116,c_181]) ).
cnf(c_1123,plain,
( sK0(g(sK1(sK3))) != g(sK1(sK3))
| ~ sP5_iProver_split
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_1116,c_186]) ).
cnf(c_1126,plain,
( sK1(sK1(sK3)) != sK1(sK3)
| ~ sP4_iProver_split
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_1116,c_184]) ).
cnf(c_1127,plain,
( g(f(sK2)) = sK2
| sK1(sK3) = sK3 ),
inference(superposition,[status(thm)],[c_1116,c_55]) ).
cnf(c_1176,plain,
( ~ sP1_iProver_split
| f(sK2) = sK3
| sK1(sK3) = sK3 ),
inference(superposition,[status(thm)],[c_1127,c_179]) ).
cnf(c_1226,plain,
( f(sK2) = sK3
| sK1(sK3) = sK3
| sP0_iProver_split ),
inference(superposition,[status(thm)],[c_180,c_1176]) ).
cnf(c_1236,plain,
( f(g(sK1(sK3))) != sK1(sK3)
| ~ sP1_iProver_split
| sK1(sK3) = sK3 ),
inference(instantiation,[status(thm)],[c_179]) ).
cnf(c_1245,plain,
( f(sK2) = sK3
| g(sK3) = sK2
| sK1(sK3) = sK3 ),
inference(superposition,[status(thm)],[c_1226,c_773]) ).
cnf(c_1338,plain,
( ~ sP4_iProver_split
| g(f(sK2)) = sK2 ),
inference(global_subsumption_just,[status(thm)],[c_1126,c_775,c_1127]) ).
cnf(c_1344,plain,
( g(f(sK2)) = sK2
| sP2_iProver_split ),
inference(superposition,[status(thm)],[c_185,c_1338]) ).
cnf(c_1387,plain,
( sK0(g(sK1(sK3))) != g(sK1(sK3))
| g(f(sK2)) = sK2 ),
inference(global_subsumption_just,[status(thm)],[c_1123,c_188,c_1123,c_1338]) ).
cnf(c_1421,plain,
( g(f(sK0(sK2))) != sK0(sK2)
| ~ sP0_iProver_split
| sK0(sK2) = sK2 ),
inference(instantiation,[status(thm)],[c_178]) ).
cnf(c_1423,plain,
( f(g(sK1(sK3))) = sK1(sK3)
| f(sK0(g(sK3))) = sK3 ),
inference(global_subsumption_just,[status(thm)],[c_895,c_197,c_200,c_187,c_774,c_804,c_884,c_1116,c_1421]) ).
cnf(c_1424,plain,
( f(sK0(g(sK3))) = sK3
| f(g(sK1(sK3))) = sK1(sK3) ),
inference(renaming,[status(thm)],[c_1423]) ).
cnf(c_1433,plain,
( f(g(sK1(sK3))) = sK1(sK3)
| sK0(g(sK3)) = g(sK3) ),
inference(superposition,[status(thm)],[c_1424,c_815]) ).
cnf(c_1436,plain,
( g(f(sK0(g(sK1(sK3))))) = sK0(g(sK1(sK3)))
| g(f(sK2)) = sK2 ),
inference(global_subsumption_just,[status(thm)],[c_1122,c_1122,c_1344]) ).
cnf(c_1442,plain,
( ~ sP2_iProver_split
| g(f(sK0(sK0(g(sK1(sK3)))))) = sK0(sK0(g(sK1(sK3))))
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_1436,c_181]) ).
cnf(c_1447,plain,
( f(sK0(g(sK1(sK3)))) = sK3
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_1436,c_55]) ).
cnf(c_1470,plain,
( sK0(g(sK1(sK3))) = g(sK3)
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_1447,c_1436]) ).
cnf(c_1483,plain,
( g(sK1(sK3)) != g(sK3)
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_1470,c_1387]) ).
cnf(c_1506,plain,
( g(sK3) = sK2
| sK1(sK3) = sK3 ),
inference(global_subsumption_just,[status(thm)],[c_1245,c_180,c_187,c_773,c_774,c_772,c_1236,c_1433]) ).
cnf(c_1512,plain,
( g(f(sK2)) = sK2
| g(sK3) = sK2 ),
inference(superposition,[status(thm)],[c_1506,c_1483]) ).
cnf(c_1565,plain,
( g(f(sK0(sK0(g(sK1(sK3)))))) = sK0(sK0(g(sK1(sK3))))
| g(f(sK2)) = sK2 ),
inference(global_subsumption_just,[status(thm)],[c_1442,c_1344,c_1442]) ).
cnf(c_1578,plain,
( f(sK0(sK0(g(sK1(sK3))))) = sK3
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_1565,c_55]) ).
cnf(c_1646,plain,
( f(sK0(g(sK3))) = sK3
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_1470,c_1578]) ).
cnf(c_1678,plain,
f(g(sK1(sK3))) = sK1(sK3),
inference(global_subsumption_just,[status(thm)],[c_847,c_187,c_774,c_772,c_1433]) ).
cnf(c_1694,plain,
( ~ sP0_iProver_split
| g(sK1(sK3)) = sK2 ),
inference(superposition,[status(thm)],[c_1678,c_178]) ).
cnf(c_1698,plain,
( ~ sP1_iProver_split
| sK1(sK3) = sK3 ),
inference(superposition,[status(thm)],[c_1678,c_179]) ).
cnf(c_1713,plain,
( sK1(sK3) = sK3
| sP0_iProver_split ),
inference(superposition,[status(thm)],[c_180,c_1698]) ).
cnf(c_1731,plain,
( g(sK1(sK3)) = sK2
| sK1(sK3) = sK3 ),
inference(superposition,[status(thm)],[c_1713,c_1694]) ).
cnf(c_1754,plain,
( sK0(g(sK3)) != g(sK3)
| ~ sP0_iProver_split
| sK0(g(sK3)) = sK2
| g(f(sK2)) = sK2 ),
inference(superposition,[status(thm)],[c_1646,c_178]) ).
cnf(c_1773,plain,
( ~ sP1_iProver_split
| f(sK2) = sK3
| g(sK3) = sK2 ),
inference(superposition,[status(thm)],[c_1512,c_179]) ).
cnf(c_1799,plain,
( f(sK2) = sK1(sK3)
| sK1(sK3) = sK3 ),
inference(superposition,[status(thm)],[c_1731,c_1678]) ).
cnf(c_1846,plain,
( f(sK2) = sK3
| g(sK3) = sK2 ),
inference(global_subsumption_just,[status(thm)],[c_1773,c_180,c_773,c_1773]) ).
cnf(c_1858,plain,
f(sK2) = sK3,
inference(superposition,[status(thm)],[c_1846,c_757]) ).
cnf(c_1859,plain,
sK1(sK3) = sK3,
inference(demodulation,[status(thm)],[c_1799,c_1858]) ).
cnf(c_1860,plain,
g(sK3) = sK2,
inference(demodulation,[status(thm)],[c_1512,c_1858]) ).
cnf(c_1909,plain,
( ~ sP2_iProver_split
| g(f(sK0(sK2))) = sK0(sK2) ),
inference(demodulation,[status(thm)],[c_771,c_1860]) ).
cnf(c_1910,plain,
( sK0(sK2) != sK2
| ~ sP5_iProver_split ),
inference(demodulation,[status(thm)],[c_772,c_1860]) ).
cnf(c_1916,plain,
~ sP4_iProver_split,
inference(backward_subsumption_resolution,[status(thm)],[c_775,c_1859]) ).
cnf(c_1923,plain,
sP5_iProver_split,
inference(backward_subsumption_resolution,[status(thm)],[c_188,c_1916]) ).
cnf(c_1924,plain,
sP2_iProver_split,
inference(backward_subsumption_resolution,[status(thm)],[c_185,c_1916]) ).
cnf(c_1925,plain,
sK0(sK2) != sK2,
inference(backward_subsumption_resolution,[status(thm)],[c_1910,c_1923]) ).
cnf(c_1929,plain,
g(f(sK0(sK2))) = sK0(sK2),
inference(backward_subsumption_resolution,[status(thm)],[c_1909,c_1924]) ).
cnf(c_1954,plain,
~ sP0_iProver_split,
inference(global_subsumption_just,[status(thm)],[c_1754,c_1421,c_1925,c_1929]) ).
cnf(c_1956,plain,
sP1_iProver_split,
inference(backward_subsumption_resolution,[status(thm)],[c_180,c_1954]) ).
cnf(c_1957,plain,
( f(g(X0)) != X0
| X0 = sK3 ),
inference(backward_subsumption_resolution,[status(thm)],[c_179,c_1956]) ).
cnf(c_1994,plain,
f(sK0(sK2)) = sK3,
inference(superposition,[status(thm)],[c_1929,c_1957]) ).
cnf(c_1998,plain,
sK0(sK2) = g(sK3),
inference(demodulation,[status(thm)],[c_1929,c_1994]) ).
cnf(c_1999,plain,
sK0(sK2) = sK2,
inference(light_normalisation,[status(thm)],[c_1998,c_1860]) ).
cnf(c_2000,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1999,c_1925]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN417+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.15 % Command : run_iprover %s %d THM
% 0.13/0.36 % Computer : n001.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sat Aug 26 20:57:47 EDT 2023
% 0.13/0.37 % 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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.51/1.16 % SZS status Started for theBenchmark.p
% 2.51/1.16 % SZS status Theorem for theBenchmark.p
% 2.51/1.16
% 2.51/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.51/1.16
% 2.51/1.16 ------ iProver source info
% 2.51/1.16
% 2.51/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.51/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.51/1.16 git: non_committed_changes: false
% 2.51/1.16 git: last_make_outside_of_git: false
% 2.51/1.16
% 2.51/1.16 ------ Parsing...
% 2.51/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.51/1.16
% 2.51/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.51/1.16
% 2.51/1.16 ------ Preprocessing... gs_s sp: 10 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.51/1.16
% 2.51/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.51/1.16 ------ Proving...
% 2.51/1.16 ------ Problem Properties
% 2.51/1.16
% 2.51/1.16
% 2.51/1.16 clauses 14
% 2.51/1.16 conjectures 14
% 2.51/1.16 EPR 5
% 2.51/1.16 Horn 6
% 2.51/1.16 unary 0
% 2.51/1.16 binary 6
% 2.51/1.16 lits 36
% 2.51/1.16 lits eq 20
% 2.51/1.16 fd_pure 0
% 2.51/1.16 fd_pseudo 0
% 2.51/1.16 fd_cond 4
% 2.51/1.16 fd_pseudo_cond 0
% 2.51/1.16 AC symbols 0
% 2.51/1.16
% 2.51/1.16 ------ Schedule dynamic 5 is on
% 2.51/1.16
% 2.51/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.51/1.16
% 2.51/1.16
% 2.51/1.16 ------
% 2.51/1.16 Current options:
% 2.51/1.16 ------
% 2.51/1.16
% 2.51/1.16
% 2.51/1.16
% 2.51/1.16
% 2.51/1.16 ------ Proving...
% 2.51/1.16
% 2.51/1.16
% 2.51/1.16 % SZS status Theorem for theBenchmark.p
% 2.51/1.16
% 2.51/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.51/1.17
% 2.51/1.17
%------------------------------------------------------------------------------