TSTP Solution File: SET723+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET723+4 : TPTP v8.2.0. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.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 : Tue May 21 03:12:58 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 66 ( 20 unt; 0 def)
% Number of atoms : 347 ( 28 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 402 ( 121 ~; 113 |; 126 &)
% ( 12 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-5 aty)
% Number of variables : 296 ( 256 !; 40 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f190,plain,
$false,
inference(subsumption_resolution,[],[f186,f92]) ).
fof(f92,plain,
apply(sK0,sK8(sK1,sK2,sK3,sK4),sK6(sK0,sK5,sK8(sK1,sK2,sK3,sK4))),
inference(unit_resulting_resolution,[],[f60,f82,f67]) ).
fof(f67,plain,
! [X2,X0,X1,X6] :
( apply(X0,X6,sK6(X0,X2,X6))
| ~ member(X6,X1)
| ~ maps(X0,X1,X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( ! [X3,X4,X5] :
( X4 = X5
| ~ apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ member(X3,X1) )
& ! [X6] :
( ( apply(X0,X6,sK6(X0,X2,X6))
& member(sK6(X0,X2,X6),X2) )
| ~ member(X6,X1) ) )
| ~ maps(X0,X1,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f41,f50]) ).
fof(f50,plain,
! [X0,X2,X6] :
( ? [X7] :
( apply(X0,X6,X7)
& member(X7,X2) )
=> ( apply(X0,X6,sK6(X0,X2,X6))
& member(sK6(X0,X2,X6),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( ! [X3,X4,X5] :
( X4 = X5
| ~ apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ member(X3,X1) )
& ! [X6] :
( ? [X7] :
( apply(X0,X6,X7)
& member(X7,X2) )
| ~ member(X6,X1) ) )
| ~ maps(X0,X1,X2) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( ! [X3,X4,X5] :
( X4 = X5
| ~ apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ member(X3,X1) )
& ! [X6] :
( ? [X7] :
( apply(X0,X6,X7)
& member(X7,X2) )
| ~ member(X6,X1) ) )
| ~ maps(X0,X1,X2) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X2] :
( maps(X0,X1,X2)
=> ( ! [X3,X4,X5] :
( ( member(X5,X2)
& member(X4,X2)
& member(X3,X1) )
=> ( ( apply(X0,X3,X5)
& apply(X0,X3,X4) )
=> X4 = X5 ) )
& ! [X6] :
( member(X6,X1)
=> ? [X7] :
( apply(X0,X6,X7)
& member(X7,X2) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( maps(X0,X1,X2)
<=> ( ! [X3,X4,X5] :
( ( member(X5,X2)
& member(X4,X2)
& member(X3,X1) )
=> ( ( apply(X0,X3,X5)
& apply(X0,X3,X4) )
=> X4 = X5 ) )
& ! [X6] :
( member(X6,X1)
=> ? [X7] :
( apply(X0,X6,X7)
& member(X7,X2) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X5,X0,X1] :
( maps(X5,X0,X1)
<=> ( ! [X2,X6,X7] :
( ( member(X7,X1)
& member(X6,X1)
& member(X2,X0) )
=> ( ( apply(X5,X2,X7)
& apply(X5,X2,X6) )
=> X6 = X7 ) )
& ! [X2] :
( member(X2,X0)
=> ? [X4] :
( apply(X5,X2,X4)
& member(X4,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maps) ).
fof(f82,plain,
member(sK8(sK1,sK2,sK3,sK4),sK4),
inference(unit_resulting_resolution,[],[f65,f71]) ).
fof(f71,plain,
! [X2,X3,X0,X1] :
( member(sK8(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
! [X0,X1,X2,X3] :
( ( equal_maps(X0,X1,X2,X3)
| ( sK8(X0,X1,X2,X3) != sK9(X0,X1,X2,X3)
& apply(X1,sK7(X0,X1,X2,X3),sK9(X0,X1,X2,X3))
& apply(X0,sK7(X0,X1,X2,X3),sK8(X0,X1,X2,X3))
& member(sK9(X0,X1,X2,X3),X3)
& member(sK8(X0,X1,X2,X3),X3)
& member(sK7(X0,X1,X2,X3),X2) ) )
& ( ! [X7,X8,X9] :
( X8 = X9
| ~ apply(X1,X7,X9)
| ~ apply(X0,X7,X8)
| ~ member(X9,X3)
| ~ member(X8,X3)
| ~ member(X7,X2) )
| ~ equal_maps(X0,X1,X2,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f53,f54]) ).
fof(f54,plain,
! [X0,X1,X2,X3] :
( ? [X4,X5,X6] :
( X5 != X6
& apply(X1,X4,X6)
& apply(X0,X4,X5)
& member(X6,X3)
& member(X5,X3)
& member(X4,X2) )
=> ( sK8(X0,X1,X2,X3) != sK9(X0,X1,X2,X3)
& apply(X1,sK7(X0,X1,X2,X3),sK9(X0,X1,X2,X3))
& apply(X0,sK7(X0,X1,X2,X3),sK8(X0,X1,X2,X3))
& member(sK9(X0,X1,X2,X3),X3)
& member(sK8(X0,X1,X2,X3),X3)
& member(sK7(X0,X1,X2,X3),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
! [X0,X1,X2,X3] :
( ( equal_maps(X0,X1,X2,X3)
| ? [X4,X5,X6] :
( X5 != X6
& apply(X1,X4,X6)
& apply(X0,X4,X5)
& member(X6,X3)
& member(X5,X3)
& member(X4,X2) ) )
& ( ! [X7,X8,X9] :
( X8 = X9
| ~ apply(X1,X7,X9)
| ~ apply(X0,X7,X8)
| ~ member(X9,X3)
| ~ member(X8,X3)
| ~ member(X7,X2) )
| ~ equal_maps(X0,X1,X2,X3) ) ),
inference(rectify,[],[f52]) ).
fof(f52,plain,
! [X0,X1,X2,X3] :
( ( equal_maps(X0,X1,X2,X3)
| ? [X4,X5,X6] :
( X5 != X6
& apply(X1,X4,X6)
& apply(X0,X4,X5)
& member(X6,X3)
& member(X5,X3)
& member(X4,X2) ) )
& ( ! [X4,X5,X6] :
( X5 = X6
| ~ apply(X1,X4,X6)
| ~ apply(X0,X4,X5)
| ~ member(X6,X3)
| ~ member(X5,X3)
| ~ member(X4,X2) )
| ~ equal_maps(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
<=> ! [X4,X5,X6] :
( X5 = X6
| ~ apply(X1,X4,X6)
| ~ apply(X0,X4,X5)
| ~ member(X6,X3)
| ~ member(X5,X3)
| ~ member(X4,X2) ) ),
inference(flattening,[],[f42]) ).
fof(f42,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
<=> ! [X4,X5,X6] :
( X5 = X6
| ~ apply(X1,X4,X6)
| ~ apply(X0,X4,X5)
| ~ member(X6,X3)
| ~ member(X5,X3)
| ~ member(X4,X2) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
<=> ! [X4,X5,X6] :
( ( member(X6,X3)
& member(X5,X3)
& member(X4,X2) )
=> ( ( apply(X1,X4,X6)
& apply(X0,X4,X5) )
=> X5 = X6 ) ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X5,X9,X0,X1] :
( equal_maps(X5,X9,X0,X1)
<=> ! [X2,X6,X7] :
( ( member(X7,X1)
& member(X6,X1)
& member(X2,X0) )
=> ( ( apply(X9,X2,X7)
& apply(X5,X2,X6) )
=> X6 = X7 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_maps) ).
fof(f65,plain,
~ equal_maps(sK1,sK2,sK3,sK4),
inference(cnf_transformation,[],[f49]) ).
fof(f49,plain,
( ~ equal_maps(sK1,sK2,sK3,sK4)
& equal_maps(compose_function(sK0,sK1,sK3,sK4,sK5),compose_function(sK0,sK2,sK3,sK4,sK5),sK3,sK5)
& injective(sK0,sK4,sK5)
& maps(sK2,sK3,sK4)
& maps(sK1,sK3,sK4)
& maps(sK0,sK4,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f39,f48]) ).
fof(f48,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( ~ equal_maps(X1,X2,X3,X4)
& equal_maps(compose_function(X0,X1,X3,X4,X5),compose_function(X0,X2,X3,X4,X5),X3,X5)
& injective(X0,X4,X5)
& maps(X2,X3,X4)
& maps(X1,X3,X4)
& maps(X0,X4,X5) )
=> ( ~ equal_maps(sK1,sK2,sK3,sK4)
& equal_maps(compose_function(sK0,sK1,sK3,sK4,sK5),compose_function(sK0,sK2,sK3,sK4,sK5),sK3,sK5)
& injective(sK0,sK4,sK5)
& maps(sK2,sK3,sK4)
& maps(sK1,sK3,sK4)
& maps(sK0,sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ equal_maps(X1,X2,X3,X4)
& equal_maps(compose_function(X0,X1,X3,X4,X5),compose_function(X0,X2,X3,X4,X5),X3,X5)
& injective(X0,X4,X5)
& maps(X2,X3,X4)
& maps(X1,X3,X4)
& maps(X0,X4,X5) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ equal_maps(X1,X2,X3,X4)
& equal_maps(compose_function(X0,X1,X3,X4,X5),compose_function(X0,X2,X3,X4,X5),X3,X5)
& injective(X0,X4,X5)
& maps(X2,X3,X4)
& maps(X1,X3,X4)
& maps(X0,X4,X5) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,plain,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( equal_maps(compose_function(X0,X1,X3,X4,X5),compose_function(X0,X2,X3,X4,X5),X3,X5)
& injective(X0,X4,X5)
& maps(X2,X3,X4)
& maps(X1,X3,X4)
& maps(X0,X4,X5) )
=> equal_maps(X1,X2,X3,X4) ),
inference(rectify,[],[f30]) ).
fof(f30,negated_conjecture,
~ ! [X5,X9,X8,X0,X1,X10] :
( ( equal_maps(compose_function(X5,X9,X0,X1,X10),compose_function(X5,X8,X0,X1,X10),X0,X10)
& injective(X5,X1,X10)
& maps(X8,X0,X1)
& maps(X9,X0,X1)
& maps(X5,X1,X10) )
=> equal_maps(X9,X8,X0,X1) ),
inference(negated_conjecture,[],[f29]) ).
fof(f29,conjecture,
! [X5,X9,X8,X0,X1,X10] :
( ( equal_maps(compose_function(X5,X9,X0,X1,X10),compose_function(X5,X8,X0,X1,X10),X0,X10)
& injective(X5,X1,X10)
& maps(X8,X0,X1)
& maps(X9,X0,X1)
& maps(X5,X1,X10) )
=> equal_maps(X9,X8,X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII14) ).
fof(f60,plain,
maps(sK0,sK4,sK5),
inference(cnf_transformation,[],[f49]) ).
fof(f186,plain,
~ apply(sK0,sK8(sK1,sK2,sK3,sK4),sK6(sK0,sK5,sK8(sK1,sK2,sK3,sK4))),
inference(backward_demodulation,[],[f148,f185]) ).
fof(f185,plain,
sK6(sK0,sK5,sK8(sK1,sK2,sK3,sK4)) = sK6(sK0,sK5,sK9(sK1,sK2,sK3,sK4)),
inference(unit_resulting_resolution,[],[f81,f86,f143,f64,f87,f150,f69]) ).
fof(f69,plain,
! [X2,X3,X0,X1,X8,X9,X7] :
( X8 = X9
| ~ apply(X1,X7,X9)
| ~ apply(X0,X7,X8)
| ~ member(X9,X3)
| ~ member(X8,X3)
| ~ member(X7,X2)
| ~ equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f150,plain,
apply(compose_function(sK0,sK2,sK3,sK4,sK5),sK7(sK1,sK2,sK3,sK4),sK6(sK0,sK5,sK9(sK1,sK2,sK3,sK4))),
inference(unit_resulting_resolution,[],[f81,f98,f83,f87,f93,f80]) ).
fof(f80,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ~ apply(X0,X7,X6)
| ~ apply(X1,X5,X7)
| ~ member(X7,X3)
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(cnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ! [X7] :
( ~ apply(X0,X7,X6)
| ~ apply(X1,X5,X7)
| ~ member(X7,X3) ) )
& ( ( apply(X0,sK10(X0,X1,X3,X5,X6),X6)
& apply(X1,X5,sK10(X0,X1,X3,X5,X6))
& member(sK10(X0,X1,X3,X5,X6),X3) )
| ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6) ) )
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f57,f58]) ).
fof(f58,plain,
! [X0,X1,X3,X5,X6] :
( ? [X8] :
( apply(X0,X8,X6)
& apply(X1,X5,X8)
& member(X8,X3) )
=> ( apply(X0,sK10(X0,X1,X3,X5,X6),X6)
& apply(X1,X5,sK10(X0,X1,X3,X5,X6))
& member(sK10(X0,X1,X3,X5,X6),X3) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ! [X7] :
( ~ apply(X0,X7,X6)
| ~ apply(X1,X5,X7)
| ~ member(X7,X3) ) )
& ( ? [X8] :
( apply(X0,X8,X6)
& apply(X1,X5,X8)
& member(X8,X3) )
| ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6) ) )
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(rectify,[],[f56]) ).
fof(f56,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ! [X7] :
( ~ apply(X0,X7,X6)
| ~ apply(X1,X5,X7)
| ~ member(X7,X3) ) )
& ( ? [X7] :
( apply(X0,X7,X6)
& apply(X1,X5,X7)
& member(X7,X3) )
| ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6) ) )
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(nnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
<=> ? [X7] :
( apply(X0,X7,X6)
& apply(X1,X5,X7)
& member(X7,X3) ) )
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(flattening,[],[f46]) ).
fof(f46,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
<=> ? [X7] :
( apply(X0,X7,X6)
& apply(X1,X5,X7)
& member(X7,X3) ) )
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(ennf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( member(X6,X4)
& member(X5,X2) )
=> ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
<=> ? [X7] :
( apply(X0,X7,X6)
& apply(X1,X5,X7)
& member(X7,X3) ) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X9,X5,X0,X1,X10,X2,X11] :
( ( member(X11,X10)
& member(X2,X0) )
=> ( apply(compose_function(X9,X5,X0,X1,X10),X2,X11)
<=> ? [X4] :
( apply(X9,X4,X11)
& apply(X5,X2,X4)
& member(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',compose_function) ).
fof(f93,plain,
apply(sK0,sK9(sK1,sK2,sK3,sK4),sK6(sK0,sK5,sK9(sK1,sK2,sK3,sK4))),
inference(unit_resulting_resolution,[],[f60,f83,f67]) ).
fof(f83,plain,
member(sK9(sK1,sK2,sK3,sK4),sK4),
inference(unit_resulting_resolution,[],[f65,f72]) ).
fof(f72,plain,
! [X2,X3,X0,X1] :
( member(sK9(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f98,plain,
apply(sK2,sK7(sK1,sK2,sK3,sK4),sK9(sK1,sK2,sK3,sK4)),
inference(unit_resulting_resolution,[],[f65,f74]) ).
fof(f74,plain,
! [X2,X3,X0,X1] :
( apply(X1,sK7(X0,X1,X2,X3),sK9(X0,X1,X2,X3))
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f87,plain,
member(sK6(sK0,sK5,sK9(sK1,sK2,sK3,sK4)),sK5),
inference(unit_resulting_resolution,[],[f60,f83,f66]) ).
fof(f66,plain,
! [X2,X0,X1,X6] :
( member(sK6(X0,X2,X6),X2)
| ~ member(X6,X1)
| ~ maps(X0,X1,X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f64,plain,
equal_maps(compose_function(sK0,sK1,sK3,sK4,sK5),compose_function(sK0,sK2,sK3,sK4,sK5),sK3,sK5),
inference(cnf_transformation,[],[f49]) ).
fof(f143,plain,
apply(compose_function(sK0,sK1,sK3,sK4,sK5),sK7(sK1,sK2,sK3,sK4),sK6(sK0,sK5,sK8(sK1,sK2,sK3,sK4))),
inference(unit_resulting_resolution,[],[f81,f97,f82,f86,f92,f80]) ).
fof(f97,plain,
apply(sK1,sK7(sK1,sK2,sK3,sK4),sK8(sK1,sK2,sK3,sK4)),
inference(unit_resulting_resolution,[],[f65,f73]) ).
fof(f73,plain,
! [X2,X3,X0,X1] :
( apply(X0,sK7(X0,X1,X2,X3),sK8(X0,X1,X2,X3))
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f86,plain,
member(sK6(sK0,sK5,sK8(sK1,sK2,sK3,sK4)),sK5),
inference(unit_resulting_resolution,[],[f60,f82,f66]) ).
fof(f81,plain,
member(sK7(sK1,sK2,sK3,sK4),sK3),
inference(unit_resulting_resolution,[],[f65,f70]) ).
fof(f70,plain,
! [X2,X3,X0,X1] :
( member(sK7(X0,X1,X2,X3),X2)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f148,plain,
~ apply(sK0,sK8(sK1,sK2,sK3,sK4),sK6(sK0,sK5,sK9(sK1,sK2,sK3,sK4))),
inference(unit_resulting_resolution,[],[f63,f82,f83,f96,f87,f93,f76]) ).
fof(f76,plain,
! [X2,X3,X0,X1,X4,X5] :
( X3 = X4
| ~ apply(X0,X4,X5)
| ~ apply(X0,X3,X5)
| ~ member(X5,X2)
| ~ member(X4,X1)
| ~ member(X3,X1)
| ~ injective(X0,X1,X2) ),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( X3 = X4
| ~ apply(X0,X4,X5)
| ~ apply(X0,X3,X5)
| ~ member(X5,X2)
| ~ member(X4,X1)
| ~ member(X3,X1) )
| ~ injective(X0,X1,X2) ),
inference(flattening,[],[f44]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( X3 = X4
| ~ apply(X0,X4,X5)
| ~ apply(X0,X3,X5)
| ~ member(X5,X2)
| ~ member(X4,X1)
| ~ member(X3,X1) )
| ~ injective(X0,X1,X2) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( injective(X0,X1,X2)
=> ! [X3,X4,X5] :
( ( member(X5,X2)
& member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X4,X5)
& apply(X0,X3,X5) )
=> X3 = X4 ) ) ),
inference(unused_predicate_definition_removal,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( injective(X0,X1,X2)
<=> ! [X3,X4,X5] :
( ( member(X5,X2)
& member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X4,X5)
& apply(X0,X3,X5) )
=> X3 = X4 ) ) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X5,X0,X1] :
( injective(X5,X0,X1)
<=> ! [X12,X13,X4] :
( ( member(X4,X1)
& member(X13,X0)
& member(X12,X0) )
=> ( ( apply(X5,X13,X4)
& apply(X5,X12,X4) )
=> X12 = X13 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',injective) ).
fof(f96,plain,
sK8(sK1,sK2,sK3,sK4) != sK9(sK1,sK2,sK3,sK4),
inference(unit_resulting_resolution,[],[f65,f75]) ).
fof(f75,plain,
! [X2,X3,X0,X1] :
( sK8(X0,X1,X2,X3) != sK9(X0,X1,X2,X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f63,plain,
injective(sK0,sK4,sK5),
inference(cnf_transformation,[],[f49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET723+4 : TPTP v8.2.0. Bugfixed v2.2.1.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n005.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 : Mon May 20 12:43:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.58/0.74 % (11566)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.58/0.74 % (11568)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.74 % (11570)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.58/0.74 % (11567)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.58/0.74 % (11569)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.58/0.74 % (11573)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.58/0.74 % (11572)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.58/0.74 % (11571)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.58/0.74 % (11573)Refutation not found, incomplete strategy% (11573)------------------------------
% 0.58/0.74 % (11573)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (11573)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74
% 0.58/0.74 % (11573)Memory used [KB]: 1089
% 0.58/0.74 % (11573)Time elapsed: 0.003 s
% 0.58/0.74 % (11573)Instructions burned: 3 (million)
% 0.58/0.75 % (11573)------------------------------
% 0.58/0.75 % (11573)------------------------------
% 0.58/0.75 % (11570)Refutation not found, incomplete strategy% (11570)------------------------------
% 0.58/0.75 % (11570)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (11570)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75
% 0.58/0.75 % (11570)Memory used [KB]: 1154
% 0.58/0.75 % (11570)Time elapsed: 0.004 s
% 0.58/0.75 % (11570)Instructions burned: 6 (million)
% 0.58/0.75 % (11570)------------------------------
% 0.58/0.75 % (11570)------------------------------
% 0.58/0.75 % (11574)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.58/0.75 % (11575)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.58/0.75 % (11566)Instruction limit reached!
% 0.58/0.75 % (11566)------------------------------
% 0.58/0.75 % (11566)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (11566)Termination reason: Unknown
% 0.58/0.75 % (11566)Termination phase: Saturation
% 0.58/0.75
% 0.58/0.75 % (11566)Memory used [KB]: 1308
% 0.58/0.75 % (11566)Time elapsed: 0.012 s
% 0.58/0.75 % (11566)Instructions burned: 35 (million)
% 0.58/0.75 % (11566)------------------------------
% 0.58/0.75 % (11566)------------------------------
% 0.58/0.75 % (11569)First to succeed.
% 0.58/0.76 % (11569)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11565"
% 0.58/0.76 % (11576)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.58/0.76 % (11569)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for theBenchmark
% 0.58/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.76 % (11569)------------------------------
% 0.58/0.76 % (11569)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (11569)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (11569)Memory used [KB]: 1220
% 0.58/0.76 % (11569)Time elapsed: 0.014 s
% 0.58/0.76 % (11569)Instructions burned: 25 (million)
% 0.58/0.76 % (11565)Success in time 0.411 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------