TSTP Solution File: PHI010+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PHI010+1 : TPTP v8.1.2. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.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 : Sun May 5 08:45:17 EDT 2024
% Result : Theorem 0.61s 0.82s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 10 unt; 0 def)
% Number of atoms : 261 ( 56 equ)
% Maximal formula atoms : 19 ( 5 avg)
% Number of connectives : 325 ( 110 ~; 101 |; 92 &)
% ( 7 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 90 ( 69 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f98,plain,
$false,
inference(avatar_sat_refutation,[],[f89,f91,f95,f97]) ).
fof(f97,plain,
spl5_1,
inference(avatar_contradiction_clause,[],[f96]) ).
fof(f96,plain,
( $false
| spl5_1 ),
inference(resolution,[],[f80,f40]) ).
fof(f40,plain,
property(sK3),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
( ~ exemplifies_property(sK3,sK4)
& sK2 = sK4
& is_the(sK2,sK3)
& object(sK4)
& property(sK3)
& object(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f15,f22]) ).
fof(f22,plain,
( ? [X0,X1,X2] :
( ~ exemplifies_property(X1,X2)
& X0 = X2
& is_the(X0,X1)
& object(X2)
& property(X1)
& object(X0) )
=> ( ~ exemplifies_property(sK3,sK4)
& sK2 = sK4
& is_the(sK2,sK3)
& object(sK4)
& property(sK3)
& object(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
? [X0,X1,X2] :
( ~ exemplifies_property(X1,X2)
& X0 = X2
& is_the(X0,X1)
& object(X2)
& property(X1)
& object(X0) ),
inference(flattening,[],[f14]) ).
fof(f14,plain,
? [X0,X1,X2] :
( ~ exemplifies_property(X1,X2)
& X0 = X2
& is_the(X0,X1)
& object(X2)
& property(X1)
& object(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X1,X2] :
( ( object(X2)
& property(X1)
& object(X0) )
=> ( ( X0 = X2
& is_the(X0,X1) )
=> exemplifies_property(X1,X2) ) ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X3] :
( ( object(X3)
& property(X1)
& object(X0) )
=> ( ( X0 = X3
& is_the(X0,X1) )
=> exemplifies_property(X1,X3) ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X0,X1,X3] :
( ( object(X3)
& property(X1)
& object(X0) )
=> ( ( X0 = X3
& is_the(X0,X1) )
=> exemplifies_property(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.g7dus8hm53/Vampire---4.8_31571',lemma_1) ).
fof(f80,plain,
( ~ property(sK3)
| spl5_1 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f78,plain,
( spl5_1
<=> property(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f95,plain,
~ spl5_3,
inference(avatar_contradiction_clause,[],[f92]) ).
fof(f92,plain,
( $false
| ~ spl5_3 ),
inference(resolution,[],[f88,f44]) ).
fof(f44,plain,
~ exemplifies_property(sK3,sK4),
inference(cnf_transformation,[],[f23]) ).
fof(f88,plain,
( exemplifies_property(sK3,sK4)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f86,plain,
( spl5_3
<=> exemplifies_property(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f91,plain,
spl5_2,
inference(avatar_contradiction_clause,[],[f90]) ).
fof(f90,plain,
( $false
| spl5_2 ),
inference(resolution,[],[f84,f41]) ).
fof(f41,plain,
object(sK4),
inference(cnf_transformation,[],[f23]) ).
fof(f84,plain,
( ~ object(sK4)
| spl5_2 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f82,plain,
( spl5_2
<=> object(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f89,plain,
( ~ spl5_1
| ~ spl5_2
| spl5_3 ),
inference(avatar_split_clause,[],[f76,f86,f82,f78]) ).
fof(f76,plain,
( exemplifies_property(sK3,sK4)
| ~ object(sK4)
| ~ property(sK3) ),
inference(resolution,[],[f75,f45]) ).
fof(f45,plain,
is_the(sK4,sK3),
inference(definition_unfolding,[],[f42,f43]) ).
fof(f43,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f23]) ).
fof(f42,plain,
is_the(sK2,sK3),
inference(cnf_transformation,[],[f23]) ).
fof(f75,plain,
! [X0,X1] :
( ~ is_the(X1,X0)
| exemplifies_property(X0,X1)
| ~ object(X1)
| ~ property(X0) ),
inference(duplicate_literal_removal,[],[f72]) ).
fof(f72,plain,
! [X0,X1] :
( exemplifies_property(X0,X1)
| ~ is_the(X1,X0)
| ~ object(X1)
| ~ property(X0)
| ~ is_the(X1,X0)
| ~ object(X1)
| ~ property(X0) ),
inference(superposition,[],[f58,f60]) ).
fof(f60,plain,
! [X2,X0] :
( sK1(X0,X2) = X2
| ~ is_the(X2,X0)
| ~ object(X2)
| ~ property(X0) ),
inference(duplicate_literal_removal,[],[f53]) ).
fof(f53,plain,
! [X2,X0] :
( sK1(X0,X2) = X2
| ~ is_the(X2,X0)
| ~ object(X2)
| ~ object(X2)
| ~ property(X0) ),
inference(equality_resolution,[],[f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( sK1(X0,X2) = X2
| X1 != X2
| ~ is_the(X1,X0)
| ~ object(X2)
| ~ object(X1)
| ~ property(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( ( ( X1 = X2
& is_the(X1,X0) )
| ! [X3] :
( X2 != X3
| ( sK0(X0,X3) != X3
& exemplifies_property(X0,sK0(X0,X3))
& object(sK0(X0,X3)) )
| ~ exemplifies_property(X0,X3)
| ~ object(X3) ) )
& ( ( sK1(X0,X2) = X2
& ! [X6] :
( sK1(X0,X2) = X6
| ~ exemplifies_property(X0,X6)
| ~ object(X6) )
& exemplifies_property(X0,sK1(X0,X2))
& object(sK1(X0,X2)) )
| X1 != X2
| ~ is_the(X1,X0) ) )
| ~ object(X2)
| ~ object(X1)
| ~ property(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f18,f20,f19]) ).
fof(f19,plain,
! [X0,X3] :
( ? [X4] :
( X3 != X4
& exemplifies_property(X0,X4)
& object(X4) )
=> ( sK0(X0,X3) != X3
& exemplifies_property(X0,sK0(X0,X3))
& object(sK0(X0,X3)) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X2] :
( ? [X5] :
( X2 = X5
& ! [X6] :
( X5 = X6
| ~ exemplifies_property(X0,X6)
| ~ object(X6) )
& exemplifies_property(X0,X5)
& object(X5) )
=> ( sK1(X0,X2) = X2
& ! [X6] :
( sK1(X0,X2) = X6
| ~ exemplifies_property(X0,X6)
| ~ object(X6) )
& exemplifies_property(X0,sK1(X0,X2))
& object(sK1(X0,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( ( ( X1 = X2
& is_the(X1,X0) )
| ! [X3] :
( X2 != X3
| ? [X4] :
( X3 != X4
& exemplifies_property(X0,X4)
& object(X4) )
| ~ exemplifies_property(X0,X3)
| ~ object(X3) ) )
& ( ? [X5] :
( X2 = X5
& ! [X6] :
( X5 = X6
| ~ exemplifies_property(X0,X6)
| ~ object(X6) )
& exemplifies_property(X0,X5)
& object(X5) )
| X1 != X2
| ~ is_the(X1,X0) ) )
| ~ object(X2)
| ~ object(X1)
| ~ property(X0) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( ( ( X1 = X2
& is_the(X1,X0) )
| ! [X3] :
( X2 != X3
| ? [X4] :
( X3 != X4
& exemplifies_property(X0,X4)
& object(X4) )
| ~ exemplifies_property(X0,X3)
| ~ object(X3) ) )
& ( ? [X3] :
( X2 = X3
& ! [X4] :
( X3 = X4
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X0,X3)
& object(X3) )
| X1 != X2
| ~ is_the(X1,X0) ) )
| ~ object(X2)
| ~ object(X1)
| ~ property(X0) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( ( ( X1 = X2
& is_the(X1,X0) )
| ! [X3] :
( X2 != X3
| ? [X4] :
( X3 != X4
& exemplifies_property(X0,X4)
& object(X4) )
| ~ exemplifies_property(X0,X3)
| ~ object(X3) ) )
& ( ? [X3] :
( X2 = X3
& ! [X4] :
( X3 = X4
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X0,X3)
& object(X3) )
| X1 != X2
| ~ is_the(X1,X0) ) )
| ~ object(X2)
| ~ object(X1)
| ~ property(X0) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( ( X1 = X2
& is_the(X1,X0) )
<=> ? [X3] :
( X2 = X3
& ! [X4] :
( X3 = X4
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X0,X3)
& object(X3) ) )
| ~ object(X2)
| ~ object(X1)
| ~ property(X0) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( ( X1 = X2
& is_the(X1,X0) )
<=> ? [X3] :
( X2 = X3
& ! [X4] :
( X3 = X4
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X0,X3)
& object(X3) ) )
| ~ object(X2)
| ~ object(X1)
| ~ property(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
! [X0,X1,X2] :
( ( object(X2)
& object(X1)
& property(X0) )
=> ( ( X1 = X2
& is_the(X1,X0) )
<=> ? [X3] :
( X2 = X3
& ! [X4] :
( object(X4)
=> ( exemplifies_property(X0,X4)
=> X3 = X4 ) )
& exemplifies_property(X0,X3)
& object(X3) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0,X2] :
( ( object(X2)
& object(X0)
& property(X1) )
=> ( ( X0 = X2
& is_the(X0,X1) )
<=> ? [X3] :
( X2 = X3
& ! [X4] :
( object(X4)
=> ( exemplifies_property(X1,X4)
=> X3 = X4 ) )
& exemplifies_property(X1,X3)
& object(X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.g7dus8hm53/Vampire---4.8_31571',description_axiom_identity_instance) ).
fof(f58,plain,
! [X2,X0] :
( exemplifies_property(X0,sK1(X0,X2))
| ~ is_the(X2,X0)
| ~ object(X2)
| ~ property(X0) ),
inference(duplicate_literal_removal,[],[f55]) ).
fof(f55,plain,
! [X2,X0] :
( exemplifies_property(X0,sK1(X0,X2))
| ~ is_the(X2,X0)
| ~ object(X2)
| ~ object(X2)
| ~ property(X0) ),
inference(equality_resolution,[],[f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( exemplifies_property(X0,sK1(X0,X2))
| X1 != X2
| ~ is_the(X1,X0)
| ~ object(X2)
| ~ object(X1)
| ~ property(X0) ),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : PHI010+1 : TPTP v8.1.2. Released v7.2.0.
% 0.03/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 18:49:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.g7dus8hm53/Vampire---4.8_31571
% 0.61/0.81 % (31996)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.81 % (31996)Refutation not found, incomplete strategy% (31996)------------------------------
% 0.61/0.81 % (31996)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (31996)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.81
% 0.61/0.81 % (31996)Memory used [KB]: 959
% 0.61/0.81 % (31996)Time elapsed: 0.002 s
% 0.61/0.81 % (31996)Instructions burned: 3 (million)
% 0.61/0.81 % (31989)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 Vampire---4 for (2995ds/34Mi)
% 0.61/0.81 % (31991)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.81 % (31990)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 Vampire---4 for (2995ds/51Mi)
% 0.61/0.81 % (31992)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.81 % (31996)------------------------------
% 0.61/0.81 % (31996)------------------------------
% 0.61/0.81 % (31994)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.81 % (31993)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 Vampire---4 for (2995ds/34Mi)
% 0.61/0.81 % (31995)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 Vampire---4 for (2995ds/83Mi)
% 0.61/0.81 % (31994)Refutation not found, incomplete strategy% (31994)------------------------------
% 0.61/0.81 % (31994)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (31994)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.81
% 0.61/0.81 % (31994)Memory used [KB]: 959
% 0.61/0.81 % (31994)Time elapsed: 0.003 s
% 0.61/0.81 % (31994)Instructions burned: 3 (million)
% 0.61/0.81 % (31993)Refutation not found, incomplete strategy% (31993)------------------------------
% 0.61/0.81 % (31993)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (31993)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.81
% 0.61/0.81 % (31993)Memory used [KB]: 974
% 0.61/0.81 % (31993)Time elapsed: 0.003 s
% 0.61/0.81 % (31993)Instructions burned: 3 (million)
% 0.61/0.81 % (31994)------------------------------
% 0.61/0.81 % (31994)------------------------------
% 0.61/0.81 % (31990)First to succeed.
% 0.61/0.81 % (31989)Refutation not found, incomplete strategy% (31989)------------------------------
% 0.61/0.81 % (31989)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (31992)Also succeeded, but the first one will report.
% 0.61/0.81 % (31989)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.81
% 0.61/0.81 % (31989)Memory used [KB]: 1044
% 0.61/0.81 % (31989)Time elapsed: 0.004 s
% 0.61/0.81 % (31989)Instructions burned: 4 (million)
% 0.61/0.81 % (31993)------------------------------
% 0.61/0.81 % (31993)------------------------------
% 0.61/0.81 % (31995)Also succeeded, but the first one will report.
% 0.61/0.81 % (31991)Also succeeded, but the first one will report.
% 0.61/0.81 % (31989)------------------------------
% 0.61/0.81 % (31989)------------------------------
% 0.61/0.81 % (31998)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 Vampire---4 for (2995ds/55Mi)
% 0.61/0.81 % (31990)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31787"
% 0.61/0.82 % (31990)Refutation found. Thanks to Tanya!
% 0.61/0.82 % SZS status Theorem for Vampire---4
% 0.61/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82 % (31990)------------------------------
% 0.61/0.82 % (31990)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.82 % (31990)Termination reason: Refutation
% 0.61/0.82
% 0.61/0.82 % (31990)Memory used [KB]: 998
% 0.61/0.82 % (31990)Time elapsed: 0.005 s
% 0.61/0.82 % (31990)Instructions burned: 5 (million)
% 0.61/0.82 % (31787)Success in time 0.446 s
% 0.61/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------